class Solution {
public static int[] searchRange(int[] nums, int target)
{
int res[]= {-1,-1};
if(nums.length==0)
{
return res;
}
int left=0;
int right=nums.length;
boolean flag=true;
while(flag)
{
if(right-left<=1)
{
flag=false;
}
int temp=(left+right)/2;
if(nums[temp]>target)
{
right=temp;
}
else if(nums[temp]<target)
{
left=temp;
}
else if(nums[temp]==target)
{
int resleft=temp;
int resright=temp;
while(resleft!=0&&nums[resleft-1]==target)
{
resleft--;
}
res[0]=resleft;
while(resright!=nums.length-1&&nums[resright+1]==target)
{
resright++;
}
res[1]=resright;
return res;
}
}
return res;
}
}