题目描述:
统计一个数字在排序数组中出现的次数。
题解:
class Solution {
public:
int GetNumberOfK(vector<int> data ,int k)
{
int n = data.size();
if(n == 0)
return 0;
int left = 0,right = n-1,pos1,pos2;
while(left < right)
{
int mid = left + (right - left)/2;
if( k > data[mid])
left = mid+1;
else
right = mid;
}
if(data[left] == k)
{
pos1 = left;
}
else
return 0;
left = 0; right = n-1;
while(left < right)
{
int mid = left + (right - left+1)/2;
if( k < data[mid])
right = mid-1;
else
left = mid;
}
if(data[right] == k)
pos2 = right;
return pos2-pos1+1;
}
};
解题思路:
二分法搜索时,左中点搜到的是最左边的点,右中点搜到的是最右边的点。