简单题,就不多写了
class Solution {
public int search(int[] nums, int target) {
int ans = 0;
for(int i = 0; i < nums.length; i++){
if(nums[i] == target)
ans++;
if(nums[i] > target)
return ans;
}
return ans;
}
}