一、题目
二、代码
class Solution
{
public int[] searchRange(int[] nums, int target)
{
int[] re = new int[2];
re[0] = -1;
re[1] = -1;
if(nums.length == 0) return re;
int length =nums.length;
int left = 0;
int right = length-1;
int mid = 0;
while(left<=right)
{
mid = (left+right)/2;
if(nums[mid]<target)
{
left = mid+1;
}
else if(nums[mid]>target)
{
right = mid -1;
}
else
{
break;
}
}
if(nums[mid] ==target)
{
int k;
for(k=mid;k>=0;k--)
{
if(nums[k] == target) re[0] = k;
}
for(k=mid;k<length;k++)
{
if(nums[k] == target ) re[1] = k;
}
}
return re;
}
}
三、运行结果