【leetcode】Array——Find the Duplicate Number（287）

题目：

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:

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.

思路：该题想了很久不会写 T^T 哎…还是自己太渣了，看了leetcode大神的思路

这道题和leetcode另一道题：找 Linked List Cycle 入口是一个原理 https://leetcode.com/problems/linked-list-cycle-ii/ https://leetcode.com/problems/linked-list-cycle-ii/ https://leetcode.com/problems/linked-list-cycle-ii/

两个指正，slow和fast。slow每次跳一个，fast每次跳2个，当fast和slow相遇时，fast比slow多走了至少一个circle，且相遇在circle内部。

相遇的位置距离circle入口 和 起点到入口的距离相等。（可以证明的。）

然后让其中一个指针（fast）回到原点，每次跳1个，slow继续从之前和fast相遇的地点出发，每次跳1个，最终两个会在入口处相遇。

circle入口在本题中就是重复的元素。

代码：

    public int findDuplicate(int[] nums) {
    	int slow = nums[0];
    	int 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;
        
    } 

leetcode大神给的答案： https://leetcode.com/discuss/61514/understood-solution-space-without-modifying-explanation