64.Find the Duplicate Number（发现重复数字）

####Level：

  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:

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.

####思路分析：

  和在一个循环链表中找两个相同元素的道理一样，设置一个快指针，一个慢指针，如果快指针和慢指针相同，则让快指针先走一步然后直到快指针的值等于 慢指针的值，则找到答案。

####代码：

public class Solution{
    public int findDuplicate(int []nums){
        int n=nums.length;
        int slow=0;
        int fast=1;
        while(nums[slow]!=nums[fast]){
            slow=(slow+1)%n;
            fast=(fast+2)%n;
            if(slow==fast){
                fast=(fast+1)%n;
            }
        }
        return nums[slow];
    }
}