leetcode 287. Find the Duplicate Number (floyd判圈算法找重复元素)
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.