[Leetcode]287. Find the Duplicate Number-CSDN博客

本文链接：https://blog.csdn.net/sunhero2010/article/details/51959513

本文介绍两种高效查找数组中重复数字的方法：一是使用快慢指针找到重复元素；二是利用二分查找实现。这两种方法均不修改原始数组且仅使用常量额外空间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

这道题可以像之前那题求链表环的入口节点一样做，快慢指针，指针相遇时，块指针从头开始遍历，两个指针遍历速度一样，在此相遇时就是出现两次的数。

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

除了用快慢指针，还可以用二分查找来解决这个问题。

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