// @Title: 统计目标成绩的出现次数 (统计目标成绩的出现次数)
// @Author: qisiii
// @Date: 2022-03-01 21:46:16
// @Runtime: 0 ms
// @Memory: 44.7 MB
// @comment: 暴力
// @flag: BLUE
class Solution {
    public int search(int[] nums, int target) {
        int count=0;
        for(int i:nums){
            if(i==target){
                count++;
            }
        }
        return count;
    }
}

// @Title: 统计目标成绩的出现次数 (统计目标成绩的出现次数)
// @Author: qisiii
// @Date: 2022-03-01 22:00:25
// @Runtime: 0 ms
// @Memory: 44.2 MB
// @comment: 二分离谱
// @flag: RED
class Solution {
    public int search(int[] nums, int target) {
        int count=0;
        int left=0,right=nums.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]>=target){
                right=mid;
            }else {
                left=mid+1;
            }
        }
        for(int i=left;i<nums.length;i++){
            if(nums[i]==target){
                count++;
            }else{
                break;
            }
        }
        return count;
    }
}