思路:双指针,二分
双指针
class Solution {
public int[] searchRange(int[] nums, int target) {
int low=0,high=nums.length-1;
if(high==-1)
return new int[]{-1,-1};
while(low<high){
if(nums[low]==target&&nums[high]==target)
return new int[]{low,high};
if(nums[low]<target) low++;
if(nums[high]>target) high--;
}
if(nums[low]==target&&nums[high]==target)
return new int[]{low,high};
return new int[]{-1,-1};
}
}
二分待补充