class Solution {
public int findDuplicate(int[] nums) {
int fast=0,low=0;
while(true){
low=nums[low];
fast=nums[nums[fast]];
if(fast==low) break;
}
low=0;
while(fast!=low){
low=nums[low];
fast=nums[fast];
}
return low;
}
}
用双指针寻找重复数
最新推荐文章于 2023-01-26 00:44:50 发布