【LeetCode.287】Find the Duplicate Number(寻找重复数 | medium)

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-the-duplicate-number
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

class Solution {
    public int findDuplicate(int[] nums) {
        int fast = 0, slow = 0;
        while(true){
            //快指针，步长为2
            //fast = nums[fast];
            //fast = nums[fast];
            fast = nums[nums[fast]];
            //慢指针，步长为1
            slow = nums[slow];
            //第一次相遇，进入环
            if(fast == slow){
                fast = 0;
                while(fast != slow){
                    fast = nums[fast];
                    slow = nums[slow];
                }
            //n圈后再次相遇，确定环入口，即重复数
            return fast;
            }
        }
    }
}