LeetCode:100.寻找重复数
目录
1.寻找重复数
1.寻找重复数
class Solution {
public:int findDuplicate(vector<int>& nums) {int slow = 0, fast = 0;while(true){slow = nums[slow];fast = nums[fast];fast = nums[fast];if(slow == fast) break;}int cur = 0;while(slow != cur){slow = nums[slow];cur = nums[cur];}return cur;}
};