Leetcode——287. 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.

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.

原题：

解答

One method:

class Solution {//可以使用unorderedmapO(N),还可以使用排序O(NlogN)，但是前者需要O(N)空间，后者需要修改原来数组元素。
public:
    int findDuplicate(vector<int>& nums) {
        int res;
        int fast=nums[nums[0]],slow=nums[0];
        if(nums.size()<=1) return -1;
        while(fast!=slow)
        {
            fast=nums[nums[fast]];
            slow=nums[slow];
        }
        fast=0;
        while(fast!=slow)
        {
            fast=nums[fast];
            slow=nums[slow];
        }
        return fast;
    }
};

参考解答：
https://discuss.leetcode.com/topic/25913/my-easy-understood-solution-with-o-n-time-and-o-1-space-without-modifying-the-array-with-clear-explanation

The Other：
binary search

class Solution {//binary search
public:
    int findDuplicate(vector<int>& nums) {
        int low=1,high=nums.size()-1;
        int mid=0,count=0;
        while(low<high)
        {
            mid=low+(high-low)/2;
            count=0;
            for(auto m:nums)
                if(m<=mid)
                    count++;
            if(count<=mid)//说明重复的数在mid+1到high
                low=mid+1;
            else//说明重复的数在1到mid
                high=mid;
        }
        return low;

    }
};