//左右遍历
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] numx=new int[2];
int l=0,r=nums.length-1;
while(l<=r){
if(nums[l]==target&nums[r]==target){
numx[0]=l;
numx[1]=r;
break;
}
if(nums[l]!=target){
l++;
}
if(nums[r]!=target){
r--;
}
}
if(l>r){
numx[0]=-1;
numx[1]=-1;
return numx;
}
return numx;
}
}
//二分查找
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] numx=new int[2];
//二分查找
int l = 0,r = nums.length - 1;
int m=0;
while (l<= r) {
int mid = l + (r - l) / 2;
if (nums[mid] == target) {
m=mid;
break;
}
else if (nums[mid] < target) {
l=mid+1;
}
else {
r=mid-1;
}
}
if (l>r) {
numx[0]=-1;
numx[1]=-1;
return numx;
}
//左右出击
int index=m;
l=index;
r=index;
while(l-1>=0&&nums[l-1]==nums[index]){
l--;
}
while(r+1<nums.length&&nums[r+1]==nums[index]){
r++;
}
numx[0]=l;
numx[1]=r;
return numx;
}
}
//解法是利用https://programmercarl.com/0034.%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.html#%E5%85%B6%E4%BB%96%E8%AF%AD%E8%A8%80%E7%89%88%E6%9C%AC的思路做出来的
其它解法: