class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l=0,r=nums.size()-1;int res=0; if(r==-1) return 0;
        while(l<r)
        {
            int mid=(l+r)/2;
            if(nums[mid]>=target) r=mid;
            else l=mid+1;
        }

         while(l<nums.size()&&nums[l]==target) res++,l++;

    return res;
    }
};