剑指 Offer 03. 数组中重复的数字
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]; } } return 0; } }
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]; } } return 0; } }