public int search(int[] nums, int target) {
int len = nums.length;
//左右边界,不能漏掉目标值
int left = 0;
int right = len -1;
while(left <= right) { //
int mid = (left + right) >>> 1; //左中位数,右中位数为:(left + right) >>> 1
if (nums[mid] > target) { //排除中位数
right = mid -1;
} else if (nums[mid] < target){
left = mid + 1;
} else {
return mid;
}
}
return -1;
}