二分查找
标准模板
LeetCode 704
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left <= right){ // 1. 退出条件
int mid = left + (right - left) / 2; // 2. 防止溢出
if (nums[mid] == target){
return mid;
}else if (nums[mid] > target){
right = mid - 1; // 更新 right
}else {
left = mid + 1; // 更新 left
}
}
return -1;
}
}