https://github.com/emahtab/find-the-duplicate-number
Find the duplicate number
https://github.com/emahtab/find-the-duplicate-number
array leetcode problem-solving tortoise-and-hare-algorithm
Last synced: 4 months ago
JSON representation
Find the duplicate number
- Host: GitHub
- URL: https://github.com/emahtab/find-the-duplicate-number
- Owner: eMahtab
- Created: 2020-04-30T18:39:07.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-04-30T19:37:11.000Z (about 5 years ago)
- Last Synced: 2025-02-02T03:25:32.227Z (5 months ago)
- Topics: array, leetcode, problem-solving, tortoise-and-hare-algorithm
- Homepage:
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Find the duplicate number
## https://leetcode.com/problems/find-the-duplicate-number
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
```
**Note:**
1. You must not modify the array (assume the array is read only).
2. You must use only constant, O(1) extra space.
3. Your runtime complexity should be less than O(n2).
4. There is only one duplicate number in the array, but it could be repeated more than once.
# Implementation : O(n)
```java
class Solution {
public int findDuplicate(int[] nums) {
// Find the intersection point of the two runners.
int tortoise = nums[0];
int hare = nums[0];
do {
tortoise = nums[tortoise];
hare = nums[nums[hare]];
} while (tortoise != hare);
// Find the "entrance" to the cycle.
tortoise = nums[0];
while (tortoise != hare) {
tortoise = nums[tortoise];
hare = nums[hare];
}
return tortoise;
}
}
```
# References :
1. https://leetcode.com/articles/find-the-duplicate-number
2. https://www.youtube.com/watch?v=LUm2ABqAs1w (Why Floyd's cycle algorithm work)