力扣-10.16-34

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] sae= {-1,-1};
		 int low=0,high=nums.length-1;
		 while(low<=high) {
			 int mid=low+(high-low)/2;
			 if(nums[mid]>target) {
				 high=mid-1;
			 }else if(nums[mid]<target) {
				 low=mid+1;
			 }else {
				 int l=mid,r=mid;
				 while(l>0 && nums[l-1]==target) {
					 l--;
				 }
				 while(r<nums.length-1 && nums[r+1]==target) {
					 r++;
				 }
				 sae[0]=l;
				 sae[1]=r;
				 break;
			 }
		 }
		 return sae;
    }
}

二分的思想，比较好想的是顺序扫描的O(n)的方法