L2-二分查找

class Solution {
    public int search(int[] nums, int target) {
        //首先关于（left + rigth)/2 取舍问题：int类型数据作除法会舍去小数部分
        int left = 0;
        int right = nums.length - 1;
       
        //int middle = (left + rigth)/2;

        while (left <= right){
            int middle = left + (right-left) / 2;
            if (nums[middle] > target){
                right = middle - 1;

            } else if (nums[middle] < target){
                left = middle + 1;
            } else {
                return middle;
            }
        }
        return -1;
    }
}