题目描述:
统计一个数字在排序数组中出现的次数。
考察重点:两次二分查找,分别锁定重复数字的左右边界点。
public int search(int[] nums, int target) {
if(nums.length == 0) //特殊情况排除
return 0;
else if(nums.length == 1 && target == nums[0]){
return 1;
}else if(nums.length == 1 && target != nums[0]){
return 0;
}
int lBoarder = 0, rBoarder = 0;
int left = 0, right = nums.length - 1;
while(left <= right){ //寻找左端点,遇到目标值后,不结束查找,而是right=mid-1继续查找左端点,直到left>right则可以认为目前right指向target子串的前一位。
int mid = left + (right-left)/2;
if(nums[mid] < target){
left = mid + 1;
}else if(nums[mid] >= target){
right = mid - 1;
lBoarder = right+1;
}
}
left = 0;
right = nums.length - 1;
while(left <= right){ //寻找右端点
int mid = left + (right-left)/2;
if(nums[mid] > target){
right = mid - 1;
}else if(nums[mid] <= target){
left = mid + 1;
rBoarder = left-1;
}
}
if(nums[lBoarder] == target && nums[rBoarder] == target) //目标值也可能不存在于数组中,对其加以判断
return rBoarder - lBoarder + 1;
else
return 0;
}



