摘要:
class Solution { public int search(int[] nums, int target) { int count = 0; for(int i=0;i<nums.length;i++){ if(nums[i]==target){ count++; } } return c 阅读全文
摘要:
class Solution { public int findRepeatNumber(int[] nums) { Arrays.sort(nums); for(int i=0;i<nums.length-1;i++){ if(nums[i]==nums[i+1]){ return nums[i] 阅读全文