34. Find First and Last Position of Element in Sorted Array

刷
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; }

转载于:https://www.cnblogs.com/reboot329/p/6158948.html

总结

以上是生活随笔为你收集整理的34. Find First and Last Position of Element in Sorted Array的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。