public int findRepeatNumber(int[] nums) {
Set<Integer> set = new HashSet<>();
for (int x : nums){
if (!set.add(x)) {
return x;
}
}
return -1;
}
public int findRepeatNumber(int[] nums) {
for (int i = 0; i < nums.length;) {
if (nums[i] == i) {
i++;
continue;
}
if (nums[nums[i]] == nums[i]) return nums[i];
int tmp = nums[i];
nums[i] = nums[tmp];
nums[tmp] = tmp;
}
return -1;
}
剑指 Offer 03. 数组中重复的数字
最新推荐文章于 2022-07-01 14:19:39 发布