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:
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(n^2).
4. There is only one duplicate number in the array, but it could be repeated more than once.

解法一
类似于链表找环的入口，用一快一慢两个指针，先找到数组的中间，再继续找重复的地方。

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        if (nums.size() <= 1) return -1;
        int slow = nums[0];
        int fast = nums[nums[0]];
        while (slow != fast) {
            slow = nums[slow];
            fast = nums[nums[fast]];
        }
        fast = 0;
        while (slow != fast) {
            slow = nums[slow];
            fast = nums[fast];
        }
        return slow;
    }
};

解法二
采用二分查找，统计小于mid的数字有多少个，如果比mid大，说明[low，mid]之间肯定有重复数字。反之，则[mid,high]之间一定有重复数字。

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        //二分查找
        int low = 1, high = nums.size() - 1;
        while (low < high) {
            int mid = (low + high) / 2;
            int count = 0;
            for (auto num : nums) {
                if (num <= mid)
                    count++;
            }
            if (count <= mid)
                low = mid + 1;
            else high = mid;
        }
        return low;
    }
};