剑指offer37-数字在排序数组中出现的次数

class Solution {
public:
    int GetNumberOfK(vector<int> data ,int k) {
        //给你一个有序的数组，找到k出现的次数
        int len = data.size();
        if(len==0) return 0;
        int begin = 0;
        int end = len-1;
        int mid = (begin+end)/2;
        int count = 0;
        while(end>=begin){
            mid = (begin+end)/2;
            if(data[mid]==k){
                for(int i=begin;i<=end;i++){
                    if(data[i]==k)
                        count++;
                }
                break;
            }
            else if(data[mid]>k){
                end = mid-1;
            }
            else{
                begin = mid+1;
            }
        }
        return count;
    }
};