287. Find the Duplicate Number
Medium
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.
Example 1:
Input: [1,3,4,2,2]
Output: 2
Example 2:
Input: [3,1,3,4,2]
Output: 3
题意
给定一个长度为n+1的数组,数组中的元素都在[0, n]之间,求重复的元素
思路
首先想到的方法:
- sort:时间复杂度O(nlogn)/空间复杂度O(1)或O(n)
- 桶计数:时间复杂度O(n)/空间复杂度O(n)
难点在于时间复杂度O(n),空间复杂度O(1)的算法。把数组视为链表,数组的索引视为链表的位置,把数组的元素视为链表的next指针指向元素的索引。如果数组中有重复元素,则该链表有环。这样就把该问题转化为一个链表判环问题。链表判环算法见LeetCode 142. Linked List Cycle II.
代码
class Solution {
public int findDuplicate(int[] nums) {
int slow = 0, fast = 0;
do {
slow = nums[slow];
fast = nums[nums[fast]];
} while (slow != fast);
slow = 0;
while (fast != slow) {
fast = nums[fast];
slow = nums[slow];
}
return slow;
}
}