leetcode704.二分查找

 1.注意边界值,left=0，right = nums.length - 1

2.防止大数溢出 mid = left + (right - left)/2;

class Solution{
	public int search(int[] nums, int target) {
		int left = 0,right = nums.length - 1;
        
		while(left < right) {
			int middle = left + (right - left)/2;
			if(nums[middle] < target) {
				left = middle + 1;
			} else if (nums[middle] > target) {
				right = middle - 1;
			} else {
				return middle;
			}	
		}
		return -1;
	}
}