二分--查找1~n中重复出现的那个数字

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.

Example 1:

Input: [1,3,4,2,2]
Output: 2

Example 2:

Input: [3,1,3,4,2]
Output: 3

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int Length = nums.size();
        int low = 1;int high = Length;
        while(low <= high){
            int mid = (low + high) / 2;
            int cnt = 0;
            for(auto num : nums){
                if(num <= mid){
                    cnt++;
                }
            }
            if(cnt <= mid){
                low = mid + 1;
            }
            else{
                high = mid - 1;
            }
        }
        return low;
    }
};