数字在排序数组中出现的次数

int BinarySearch(vector<int> data,int low,int high,int k)
    {
        while(low <= high)
        {
            int m = low + (high-low)/2;
            if(data[m] == k)
                 return m;
            else if(data[m] > k)
                high = m-1;
            else
                low = m+1;
        }
        return -1;
    }
    int GetNumberOfK(vector<int> data ,int k) {
        int len = data.size();
        int index ;
        index = BinarySearch(data,0,len-1,k);
        if(index == -1)
            return 0;
        int low = index-1;
        int n1 = 0;
        int n2 = 0;
        int high = index+1;
        while((low >= 0) && (data[low] == k))
        {
            low--;
            n1++;
        }
        while((high<len) && (data[high] == k))
        {
            high++;
            n2++;
        }
        return n1+n2+1;
    }

    int GetNumberOfK(vector<int> data ,int k) {
        return biSearch(data, k+0.5) - biSearch(data, k-0.5) ;
    }
    int biSearch(const vector<int> & data, double num){
        int s = 0, e = data.size()-1;     
        while(s <= e){
            int mid = (e - s)/2 + s;
            if(data[mid] < num)
                s = mid + 1;
            else if(data[mid] > num)
                e = mid - 1;
        }
        return s;
    }