//参考评论区解答,还要再消化消化,主要是边界的选择
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] result={-1,-1};
if(nums.length==0) return result;
int l=0,r=nums.length-1,mid=0;
while(l<r){
mid=l+(r-l)/2;
if(nums[mid]>=target) r=mid;
else l=mid+1;
}
if(nums[l]!=target) return result;
result[0]=l;
r=nums.length;
while(l<r){
mid=l+(r-l)/2;
if(nums[mid]<=target) l=mid+1;
else r=mid;
}
result[1]=l-1;
return result;
}
}