class Solution {
public int search(int[] nums, int target) {
if((nums[0]>target)||(nums[nums.length-1]<target)){
return -1;
}
int left=0;
int right=nums.length-1;
while(left<=right){
int middle=( left + right ) / 2;
if(nums[middle]<target){
left=middle+1;
}
else if((nums[middle]>target)){
right=middle-1;
}
else{
return middle;
}
}
return -1;
}
}
此处每一次循环的middle值为**( left + right ) / 2**,这样写可能会导致超时,因为如果left和right的值太大,会导致溢出,超出整型变量middle所能接收的范围。所以需要一种办法来解决这种溢出。办法如下:
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = (right - left) / 2 + left;
int num = nums[mid];
if (num == target) {
return mid;
} else if (num > target) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return -1;
}
}
每一次循环将middle的值设置成left + (right - left) / 2,或者right - (right - left) / 2**,能够有效避免整型溢出。实质上这两个式子的计算结果仍然是 ( left + right ) / 2,可以手动算一下,这三个式子等价,但是将其变形就能有效防止整型溢出。希望能够帮到大家!