704. 二分查找

https://leetcode-cn.com/problems/binary-search/

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

class Solution {     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 ){                 high = mid - 1;             }               if( nums[mid] < target ){                 low = mid + 1;             }                if( nums[mid] == target ){                 return mid;             }         }         return -1;     } }