解题思路:
两次二分,第一次定左边的位置,第二次定右边的位置,也算模板。
class Solution {
public int[] searchRange(int[] nums, int target) {
int l = 0, r = nums.length - 1;
int first = -1, last = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (nums[mid] == target) {
first = mid;
r = mid - 1;//重点,向左找
} else if (nums[mid] > target) {
r = mid - 1;
} else {
l = mid + 1;
}
}
l = 0;
r = nums.length - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (nums[mid] == target) {
last = mid;
l = mid + 1;//重点,向右找
} else if (nums[mid] > target) {
r = mid - 1;
} else {
l = mid + 1;
}
}
return new int[] { first, last };
}
}