class Solution {
public int[] searchRange(int[] nums, int target) {
int[] ans={-1,-1};
int left=0,right=nums.length-1;
while(left<=right){
int mid=(left+right)/2;
if(nums[mid]==target){
for(int temp=mid;temp>=0;--temp){
if(temp==0&&nums[temp]==target){
ans[0]=0;
}else if(nums[temp]!=target){
ans[0]=temp+1;
break;
}
}
for(int temp=mid;temp<=nums.length-1;++temp){
if(temp==nums.length-1&&nums[temp]==target){
ans[1]=nums.length-1;
}else if(nums[temp]!=target){
ans[1]=temp-1;
break;
}
}
break;
}
if(nums[mid]>target){
right=mid-1;
}
if(nums[mid]<target){
left=mid+1;
}
}
return ans;
}
}
完美,击败100%