leetcode287 Find the Duplicate Number

287. Find the Duplicate Number

Total Accepted: 21710 Total Submissions: 57132 Difficulty: Hard

Given an array nums containing n + 1 integers where each integer is between 1 andn (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(n2).
4. There is only one duplicate number in the array, but it could be repeated more than once.

要求里要求空间复杂度为O(1)，达不到要求也可以过。下面AC代码利用二分来做。

class Solution {
public:
    int findDuplicate(vector<int>& nums)
    {
    int left = 1;
    int right = nums.size() - 1;
    while (left < right)
    {
        int cnt = 0;
        int mid = (left + right) / 2;
        for (int i : nums)
            if (i <= mid)
                ++cnt;
        if (mid < cnt)
            right = mid;
        else
            left = mid + 1;
    }
    return left;
    }
};