刷
June-21-2019

最早的時候被邊界條件各種惡心。

YLNR大法，注意最后的邊界。

public int[] searchRange(int[] nums, int target) {if (nums == null || nums.length == 0 || nums[0] > target || nums[nums.length - 1] < target) {return new int[]{-1, -1};}int l = 0, r = nums.length - 1;while (l <= r) {int m = l + (r - l) / 2;if (nums[m] >= target) {r = m - 1;} else {l = m + 1;}}int[] result = new int[]{-1, -1};if (nums[l] != target) {return result;} else {result[0] = l;}l = 0;r = nums.length - 1;while (l <= r) {int m = l + (r - l) / 2;if (nums[m] <= target) {l = m + 1;} else {r = m - 1;}}result[1] = r;return result; }

轉(zhuǎn)載于:https://www.cnblogs.com/reboot329/p/6158948.html

總結(jié)

以上是生活随笔為你收集整理的34. Find First and Last Position of Element in Sorted Array的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。