class Solution {
public int findRepeatNumber(int[] nums) {
HashSet<Integer> set=new HashSet<>();
int len=nums.length;
for(int i=0;i<len;i++){
if(!set.add(nums[i])) return nums[i];
}
return -1;
}
}
class Solution {
public int findRepeatNumber(int[] nums) {
int len=nums.length;
for(int i=0;i<len;i++){
if(i==nums[i]) continue;
if(nums[i]==nums[nums[i]]) return nums[i];
int temp = nums[nums[i]];
nums[nums[i]] = nums[i];
nums[i] = temp;
i--;
}
return -1;
}
}