AcWing 67. 数字在排序数组中出现的次数（C++）- 二分

题目链接：https://www.acwing.com/problem/content/63/
题目如下：

class Solution {
public:
    int getNumberOfK(vector<int>& nums , int k) {
        //查找第一个和查找最后一个等于给定值的元素
        //前提：数组中的元素是有序的
        int left=-1,right=-1;
        //查找第一个
        int low=0,high=nums.size()-1;
        while(low<=high){
            int mid=low+(high-low)/2;
            if(nums[mid]==k){
                if(mid==0||nums[mid-1]!=k) {left=mid;break;}
                else high=mid-1;
            }else if(nums[mid]>k){
                high=mid-1;
            }else low=mid+1;
        }
        
        //查找最后一个
        low=0;high=nums.size()-1;
        while(low<=high){
            int mid=low+(high-low)/2;
            if(nums[mid]==k){
                if(mid==nums.size()-1||nums[mid+1]!=k) {right=mid;break;}
                else low=mid+1;
            }else if(nums[mid]>k){
                high=mid-1;
            }else low=mid+1;
        }
        
        if(left==-1&&right==-1) return 0;//特判
        else return right-left+1;
    }
};