剑指offer53数字在升学数组中出现的次数(二分法)

剑指offer53数字在升学数组中出现的次数

class Solution {
public:
    int GetNumberOfK(vector<int> data ,int k) {
        if(data.size() == 0) return 0;
        int left = getFirstk(data, 0, data.size() - 1, k);
        int right = getLastk(data, 0, data.size() - 1, k);
        if(left != -1 && right != -1) {
            return right - left + 1;
        }
        return 0;
    }
private:
    int getFirstk(vector<int> data, int l, int r, int k) {
        if(l > r) return -1;    //不能带等号
        int m = l + (r - l) / 2;
        int midValue = data[m];
        if(midValue == k) {
            if(m > 0 && data[m - 1] != k || m == 0) {
                return m;
            }
            else
                r = m - 1;
        }
        else if(midValue < k)
            l = m + 1;
        else 
            r = m - 1;
        return getFirstk(data, l, r, k);
    }
    int getLastk(vector<int> data, int l, int r, int k) {
        if(l > r) return -1;    //不能带等号
        int m = l + (r - l) / 2;
        int midValue = data[m];
        if(midValue == k) {
            if(m < data.size() - 1 && data[m + 1] != k || m == data.size() - 1) {
                return m;
            }
            else {
                l = m + 1;
            }
        }
        else if(midValue < k)
            l = m + 1;
        else
            r = m - 1;
        return getLastk(data, l, r, k);
    }
};