闭区间写法
class Solution {
public int search(int[] nums, int target) {
int n = nums.length;
int l = 0;
int r = n-1;
int mid;
while(l<=r) {
//防止溢出
mid = l + (r - l)/2;
// mid=(r - l)>>>1;
if(nums[mid]>target) {
r = mid -1;
}
else if(nums[mid]<target) {
l = mid + 1;
}
else
return mid;
}
return -1;
}
}
左闭右开区间写法
class Solution {
public int search(int[] nums, int target) {
int n = nums.length;
int l = 0;
int r = n;
int mid;
while(l<r) {
//防止溢出
mid = l + (r - l)/2;
// mid=(r - l)>>>1;
if(nums[mid]>target) {
r = mid;
}
else if(nums[mid]<target) {
l = mid + 1;
}
else
return mid;
}
return -1;
}
}