[LeetCode 287] Find the Duplicate Number

最新推荐文章于 2021-12-17 00:37:20 发布

ExcitedZhang

最新推荐文章于 2021-12-17 00:37:20 发布

阅读量67

点赞数

分类专栏： LeetCode 文章标签： LeetCode 数组分治

本文链接：https://blog.csdn.net/ExcitedZhang/article/details/89344433

版权

LeetCode 专栏收录该内容

118 篇文章 0 订阅

订阅专栏

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.

分析

这一题是一个中等难度的题目。题目要求不能更改数组，那么排序的方式就没法使用了。使用空间也要求是O(1),那么也不能进行计数。

n+1个[1, n]的数赛到了n大小的数组中，我们注意数字的范围[1, n]。如果某一个数d是重复的，那么<=d的数字的个数一定会>d。

在[1, n]中任意取一个数字m，如果<=m的数字的个数是大于>m的，那么结果一定在[1, m]中；如果> m的数字的个数一定是 > m的，那么结果一定在[m+1, n]中。这样我们就可以在[0, n]中做二分法寻找该数字。

Code

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

运行效率

Runtime: 12 ms, faster than 99.08% of C++ online submissions for Find the Duplicate Number.

Memory Usage: 9.9 MB, less than 60.90% of C++ online submissions for Find the Duplicate Number.