给定一个升序排列的整数数组,和一个目标值,找出给定目标值在数组中的开始位置和结束位置,如果数组中不存在目标值,返回[-1,-1]
输入:nums = [5,7,7,8,8,10], target = 8
输出:[3,4]
输入:nums = [5,7,7,8,8,10], target = 6
输出:[-1,-1]
思路:
通过二分法来找出目标值的左边界和右边界
public int[] searchRange(int[] nums, int target) {
int[] re = {-1,-1};
re[0] = binarySearch(nums, target, true); // 查找左边界
re[1] = binarySearch(nums, target, false); // 查找右边界
return re;
}
public int binarySearch(int[] nums, int target, boolean leftRight) {
int ans = -1;
int left = 0, right = nums.length - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
if (nums[mid] == target) {
ans = mid;
if (leftRight)
right = mid - 1; // 寻找左边界,则在mid左边继续找
else
left = mid + 1; // 寻找右边界,则在mid右边继续找
} else if (nums[mid] < target)
left = mid + 1;
else
right = mid - 1;
}
return ans;
}