34. 在排序数组中查找元素的第一个和最后一个位置

package leetcode;

public class demo_34 {
    public int[] searchRange(int[] nums, int target) {
        int[] s= {-1,-1};
        if(nums.length==0) {return s;}
        int right=nums.length-1;
        int left=0;
        int mid=(right+left)/2;
        //通过二分法来查找target的位置
        while(left<=right) {
            mid=(left+right)/2;
            if(target>nums[mid]) {
                left=mid+1;
            }
            if(target<nums[mid]) {
                right=mid-1;
            }
            if(target==nums[mid]) {
                left=mid;
                right=mid;
                while(left>=0&&nums[left]==target) {left=left-1;}
                s[0]=left+1;
                while(right<nums.length&&nums[right]==target) {right=right+1;}
                s[1]=right-1;
                break;
            }
        }
        for(int i:s) {
            System.out.print(i+" ");
        }
        return s;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_34 d34=new demo_34();
        int[] nums= {5,7,7,8,8,10};
        d34.searchRange(nums, 8);
    }

}