给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
如果数组中不存在目标值 target,返回 [-1, -1]。
分别求左边界和右边界:
class Solution {
public int[] searchRange(int[] nums, int target) {
int rightBoard = searchR(nums, target);
int leftBoard = searchL(nums, target);
if ((rightBoard < 0) || (leftBoard > nums.length - 1)) {
return new int [] {-1, -1};
}else if (rightBoard - leftBoard > 1){
return new int [] {leftBoard + 1, rightBoard - 1};
}else {
return new int [] {-1, -1};
}
}
public int searchR(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int rightBoard = -1;
while(left <= right) {
int mid = (left + right)/2;
if (nums[mid] > target) {
right = mid - 1;
}else {
left = mid + 1;
rightBoard = left;
}
}
return rightBoard;
}
public int searchL(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int leftBoard = nums.length;
while(left <= right) {
int mid = (left + right)/2;
if (nums[mid] < target) {
left = mid + 1;
}else {
right = mid - 1;
leftBoard = right;
}
}
return leftBoard;
}
}