x mod L = Z
Взято из видео https://www.youtube.com/watch?v=9YTjXqqJEFE&t=758s
Использовал для решения https://leetcode.com/problems/find-the-duplicate-number
public int findDuplicate(int[] nums) {
int slow = 0;
int fast = 0;
do {
slow = nums[slow];
fast = nums[nums[fast]];
} while (slow != fast);
fast = 0;
while (slow != fast) {
slow = nums[slow];
fast = nums[fast];
}
return fast;
}