二分查找

class Solution {
    public int search(int[] nums, int target) {
        int l=0,r=nums.length-1;
        int mid = (l+r)>>1;
        while(l<r){
            if(nums[mid] < target){
                if(mid+1 < nums.length && nums[mid] > target){
                    return -1;
                }
                l = mid+1;
            }else if(nums[mid] > target){
                if(mid-1 >= 0  && nums[mid] < target){
                    return -1;
                }
                r = mid;
            }else{
                return mid;
            }
            mid = (l+r)>>1;
        }
        if(nums[mid] == target){
            return mid;
        }else{
            return -1;
        } 
    }
}