Find the Duplicate Number问题及解法

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

我们要爱学习

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

阅读量471

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium Two Pointers

本文链接：https://blog.csdn.net/u011809767/article/details/77981928

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述:

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.

问题分析：

本题看似附加要求很多，实质上跟142. Linked List Cycle II 的解法类似，利用双指针，找到fast和slow相遇的值，再去找到circle的入口即可。

过程详见代码：

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int slow = nums[0],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;
    }
};