题目给出一个有序数组,要求统计目标数字在数组中出现的次数。最开始尝试使用暴力解法会超时,故使用二分法,代码如下:
class Solution {
public:
int search(vector<int>& nums, int target) {
if(nums.empty())return 0; //判断数组为空时返回0
int size = nums.size(); //得到数组大小
int left = 0;//二分法,左边下标为0
int right = size - 1;//右边下标为size - 1
int mid = 0;
int x, y;
while(left < right)
{
mid = left + (right - left) / 2;
if (nums[mid] >= target) right = mid;//使left始终向target最左端靠拢
else left = mid + 1;
}
x = left; //x为target最左端的下标
right = size ; //更新right的值
if(nums[left]!=target )return 0;
while(left<right){
mid=(left+right)/2;
if(nums[mid]<=target) left=mid+1; //使right始终向target最右端靠拢
else right=mid;
}
y=left;
return y-x;
}
};
两次二分法分别找出target的最左端和最右端,妙。