# Find the duplicate number

总结 Leetcode find-the-duplicate-number 的做法。

## Problem

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.