leetcode

0 class Solution {

1 public:

2 int findDuplicate(vector<int> &nums) {

3 int slow = 0, fast = 0;

4 while (true) {

5 fast = nums[nums[fast]];

6 slow = nums[slow];

7 if (fast == slow) {

8 fast = 0;

9 while (fast != slow) {

10 fast = nums[fast];

11 slow = nums[slow];

12 }

13 return fast;

14 }

15 }

16 }

17 };