我希望有人可以帮助我理解此代码以进行二进制搜索。来自LeetCode,在“二进制搜索”下是“模板2”。
我想知道为什么您要设置nums.length -它不是nums.length-1的原因吗?
int binarySearch(int[] nums, int target){
if(nums == null || nums.length == 0)
return -1;
int left = 0, right = nums.length;
while(left < right){
// Prevent (left + right) overflow
int mid = left + (right - left) / 2;
if(nums[mid] == target){ return mid; }
else if(nums[mid] < target) { left = mid + 1; }
else { right = mid; }
}
// Post-processing:
// End Condition: left == right
if(left != nums.length && nums[left] == target) return left;
return -1;
}