34. 在排序数组中查找元素的第一个和最后一个位置
- 使用二分法求解
- 为了更好的区分左右两个节点,推荐使用两次二分法。
- 左侧节点的结束条件是nums[middle] == target 且 middle == 0 || nums[middle - 1] < target。当满足nums[middle] == target 条件时,但是不满足后一个条件,说明不是最左侧的,让middle向左移动。
- 对于右侧节点,也是同理。
class Solution {
int searchRangeLeft(int[] nums, int target){
int leftBoard = -2;
int left = 0;
int middle;
int right = nums.length - 1;
while(left <= right){
middle = left + (right - left)/2;
if(nums[middle] == target){
if(middle == 0 || nums[middle - 1] < target){
return middle;
}
right = middle - 1;
}
else if(nums[middle] < target)
left = middle + 1;
else if(nums[middle] > target)
right = middle - 1;
}
return leftBoard;
}
int searchRangeRight(int[] nums, int target){
int rightBoard = -2;
int left = 0;
int middle;
int right = nums.length - 1;
while(left <= right){
middle = left + (right - left)/2;
if(nums[middle] == target){
if(middle == nums.length - 1 || nums[middle + 1] > target){
return middle;
}
left = middle + 1;
}
else if(nums[middle] < target)
left = middle + 1;
else if(nums[middle] > target)
right = middle - 1;
}
return rightBoard;
}
public int[] searchRange(int[] nums, int target) {
int leftBoard = searchRangeLeft(nums,target);
int rightBoard = searchRangeRight(nums,target);
if(leftBoard == -2 || rightBoard == -2){
return new int[]{-1,-1};
}
if(rightBoard - leftBoard >= 0 ){
return new int[]{leftBoard,rightBoard };
}
return new int[]{-1,-1};
}
}