class Solution {
public:
int findDuplicate(vector<int>& nums) {
int s=nums[0],f=nums[s];
while(f!=s)
{
s=nums[s];
f=nums[nums[f]];
}
f=0;
while(f!=s)
{
s=nums[s];
f=nums[f];
}
return f;
}
};
leetcode - 287. Find the Duplicate Number
最新推荐文章于 2022-03-10 09:50:06 发布