class Solution {
    public int search(int[] nums, int target) {
 
    }
}

  class Solution {
    public int search(int[] nums, int target) {
        int sum=0;
        if (nums.length == 0) {
            return 0;
        }
        for(int i=0;i<nums.length;i++){
            if(nums[i]==target){
                sum++;
            }
        }
        return sum;
    }
}

//二分法
class Solution {
    public int search(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        int count=0;
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]>=target){
                right=mid;
            }else{
                left=mid+1;
            }
        }
        while(left<nums.length&&nums[left++]==target){
            count++;
        }
        return count;
    }
}