二分查找法java实现

Posted 2021-12-17 zhangjin1120

    public int search(int[] nums, int target) 
        int low = 0;
        int high = nums.length - 1;
        while (low <= high) 
            int mid = (low + high)/2;
            if (nums[mid] == target) 
                return mid;
             else if (target > nums[mid]) 
                low = mid + 1;
             else 
                high = mid - 1;
            
        
        return -1;