剑指 Offer 53 - I. 在排序数组中查找数字 I

class Solution {
    public int search(int[] nums, int target) {
        int count = 0;
        for(int i=0;i){
            if(nums[i]==target){
                count++;
            }
          }

            return count;
  
    }
   
}