class Solution {
public int search(int[] nums, int target) {
if(nums==null || nums.length==0)
return -1;
int left=0;
int right=nums.length-1;
int mid=0;
while(left<=right)
{
mid=left+(right-left)/2;
if(nums[mid]>target)
right=mid-1;
else if(nums[mid]<target)
left=mid+1;
else if (nums[mid]==target)
return mid;
}
return -1;
}
}
每次缩减一半的范围
每次缩减范围不能把答案所在范围切掉