<medium>LeetCode Problem -- 287. Find the Duplicate Number

• 描述：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.
  Note:

  You must not modify the array (assume the array is read only).
  You must use only constant, O(1) extra space.
  Your runtime complexity should be less than O(n2).
  There is only one duplicate number in the array, but it could be repeated more than once.

• 分析：寻找数组中的重复元素。

• 思路一：如果只是寻找数组中的重复元素那么水题无疑，但关键在于如何在题目中的诸多限制条件下完成。这里我使用二分查找法来进行解决。

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int low = 1;
        int high = nums.size() - 1;
        int mid;
        while(low < high) {
            mid = (low + high) / 2;
            int count = 0;
            // 统计数组中小于中间值的个数
            for (int i = 0; i < nums.size(); i++) {
                if (nums[i] <= mid) count++;
            }
            if (count > mid) high = mid;
            else low = mid + 1; 
        }
        return low;
    }
};