[leetcode-287] Find the Duplicate Number

Problem Describtion

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:

You must not modify the array (assume the array is read only).
You must use only constant, O(1) extra space.
Your runtime complexity should be less than O(n2).
There is only one duplicate number in the array, but it could be repeated more than once.

Solution

Binary serch

key point: for any number:n in array, the count:c of elements that “<= n” should fufill the condiction: c <= n. Otherwise, one of number in range from 1 to n may appear more than once time.

example:

0 1 2 3 4 5 6 7 8 9
1 2 3 4 5 6 7 8 9 x

0 1 2 3 4 5 6 7 8 9
1 2 3 3 5 6 7 8 9 x   ==> x = 3 or x = 4 ==> len(num <= 5) > 5

0 1 2 3 4 5
1 2 3 3 5 6 7 8 9 3/4

    2 3 4 5
1 2 3 3 5 6 7 8 9 3/4

      3 4 5
1 2 3 3 5 6 7 8 9 3/4

      3 4 
1 2 3 3 5 6 7 8 9 3/4

      3
1 2 3 3 5 6 7 8 9 3/4

code:

 int findDuplicate(vector<int>& nums) {
        /*binary search
        对于任意数n，如果比它小的数出现了 >n 次，则说明1到n中有数字至少出现了两次。
        */
        int left = 0, right = nums.size();
        
        while(left < right) {
            int mid = (left + right) / 2;
            
            int count = 0;
            for(int num: nums) {
                if(num <= mid) {
                    count++;
                }
            }
            
            if(count > mid){
                right = mid;
            } else {
                left = mid + 1;
            }
            
        }
        
        return left;

Transfer to problem of finding crycle in a link table

code:

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
 int slow = 0, fast = 0, find = 0;
        
        while(1) {
            slow = nums[slow];
            fast = nums[nums[fast]];
            
            if(slow == fast) {
                break;
            }
        }
        
        while(1) {
            find = nums[find];
            slow = nums[slow];
            
            if(find == slow) {
                return slow;
            }
        }
        
    }
};

reference:

https://leetcode.com/problems/find-the-duplicate-number/discuss/588610/Understanding-the-Floyds-Cycle-detection.-THE-REASON-WHY-IT-WORKS!