二分查找：统计一个数字在递增数组中出现的次数

 

class Solution {
public:
    int findPos(vector<int> v,double x)
    {
        int l = 0;
        int r = v.size()-1;
        
        //核心代码就这么多
        while(l<=r)
        {
            int mid = (l+r)/2;
            if(v[mid]<x)
            {
                l=mid+1;
            }
            else if(v[mid]>x)
            {
                r=mid-1;
            }
        }
        
        return l;
    }
    
    int GetNumberOfK(vector<int> v ,int k) {
        int pos1 = findPos(v,k-0.5);
        int pos2 = findPos(v,k+0.5);
        return pos2-pos1;
    }

};