剑指 Offer 53 - I.在排序数组中查找数字
看到是排序数组,最好的办法就是二分查找,这题需要通过两次二分查找,找到target的左边界和右边界,右边界-左边界-1就是答案。我最先想到的就是开区间,用 i <= j, j = mid -1,i = mid +1,这个组合。
找右边界:
while(i <= j) { //找右边界
if(nums[mid] <= target) i = mid + 1;
if(nums[mid] > target) j = mid - 1;
mid = (i + j) / 2;
}
右边界 = i
找左边界:
while(i <= j) { //找左边界
if(nums[mid] >= target) j = mid - 1;
if(nums[mid] < target) i = mid + 1;
mid = (i + j) / 2;
}
左边界 = j
优化:
当找到右边界时,如果存在target的,那nums[j]就是target,左边界就在0-j这个区间中,不用在0-nums.length-1中找,节省了时间;如果nums[j]不等于target,说明不存在target,直接返回0即可。
class Solution {
public int search(int[] nums, int target) {
int i,j,mid;
i = 0;
j = nums.length-1;
mid = (i + j) / 2;
int r; //右边界
while(i <= j) { //找右边界
if(nums[mid] <= target) i = mid + 1;
if(nums[mid] > target) j = mid - 1;
mid = (i + j) / 2;
}
r = i;
if(j >= 0 && nums[j] != target) return 0;
i = 0;
mid = (i + j) / 2;
while(i <= j) { //找左边界
if(nums[mid] >= target) j = mid - 1;
if(nums[mid] < target) i = mid + 1;
mid = (i + j) / 2;
}
int l = j; //左边界
return r-l-1;
}
}
还有一种优化是:将找右边界封装成函数,寻找target的右边界和target-1的右边界,两边界相减即为结果。
class Solution {
public int search(int[] nums, int target) {
return helper(nums, target) - helper(nums, target - 1);
}
int helper(int[] nums, int tar) {
int i = 0, j = nums.length - 1;
while(i <= j) {
int m = (i + j) / 2;
if(nums[m] <= tar) i = m + 1;
else j = m - 1;
}
return i;
}
}