自己的做法就是求目标数的边界下标,为了保持时间复杂度在logn,利用二分查找去求边界下标。
class Solution {
public int[] searchRange(int[] nums, int target) {
int [] shuZu = new int[2];//定义数组,返回两个下标用数组
shuZu[0] = -1;//初始化为-1
shuZu[1] = -1;
int start = 0;//二分查找的左边界
int end = nums.length-1;
if(nums.length == 0){
return shuZu;
}//如果待查数组为空,则直接返回数组
while (start <= end) {//二分查找
int mid = (start + end) / 2;
int j = mid -1;//寻找mid的前一个,用来判断是否是target的边界下标-----即假如mid是target,则我要求target的左边界下标,只有当nums[j]<target且nums[mid]==target时才满足
if (nums[mid] == target){
if(j >= 0){//用来保证不会数组越界,即保证数组中target在边界的情况
if (nums[j] < target) {//若满足,则mid处就是第一个target
shuZu[0] = mid;
break;
}else{//此时target不在边界,但是mid所在处不是我们要找的第一个出现的target下标(左边界),所以左边界一定在mid的左边,则end = mid -1;
end = mid-1;
}
}else{//若此时target在边界,则说明mid处就是左边界
shuZu[0] = mid;
break;
}
}else if (nums[mid] > target) {//二分法的常规操作
end = mid - 1;
}else {
start = mid + 1;
}
}
start = 0;
end = nums.length-1;
while (start <= end) {//求右边界,原理同上
int mid = (start + end) / 2;
int k = mid + 1;
if (nums[mid] == target){
if(k<=nums.length-1){
if (nums[k] > target) {
shuZu[1] = mid;
break;
}else{
start = mid+1;
}
}else{
shuZu[1] = mid;
break;
}
}else if (nums[mid] > target) {
end = mid - 1;
}else {
start = mid + 1;
}
}
return shuZu;
}
}
代码随想录中的做法就是将==与 < 或者 > 的情况合并,这样当找到nums[middle] == target的时候也更新right,就可以找到右边界。
Solution {
int[] searchRange(int[] nums, int target) {
int leftBorder = getLeftBorder(nums, target);
int rightBorder = getRightBorder(nums, target);
// 情况一
if (leftBorder == -2 || rightBorder == -2) return new int[]{-1, -1};
// 情况三
if (rightBorder - leftBorder > 1) return new int[]{leftBorder + 1, rightBorder - 1};
// 情况二
return new int[]{-1, -1};
}
int getRightBorder(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int rightBorder = -2; // 记录一下rightBorder没有被赋值的情况
while (left <= right) {
int middle = left + ((right - left) / 2);
if (nums[middle] > target) {
right = middle - 1;
} else { // 寻找右边界,nums[middle] == target的时候更新left
left = middle + 1;
rightBorder = left;
}
}
return rightBorder;
}
int getLeftBorder(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int leftBorder = -2; // 记录一下leftBorder没有被赋值的情况
while (left <= right) {
int middle = left + ((right - left) / 2);
if (nums[middle] >= target) { // 寻找左边界,nums[middle] == target的时候更新right
right = middle - 1;
leftBorder = right;
} else {
left = middle + 1;
}
}
return leftBorder;
}