leetcode_c++：Find the Duplicate Number(287)

题目

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.

---

算法

二分
时间 O(NlogN) 空间 O(1)
二分查找, 1..10,, 小于等于5的一定有5个,如果多于5个,就在lower part, 等于5个就是upper part.

---

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int min=0,max=nums.size()-1;
        while(min<=max){
            // 找到中间那个数
            int mid = min + (max - min) / 2;
            int cnt = 0;

            // 计算总数组中有多少个数小于等于中间数
            for(int i = 0; i < nums.size(); i++){
                if(nums[i] <= mid){
                    cnt++;
                }
            }
            // 如果小于等于中间数的数量大于中间数，说明前半部分必有重复
            if(cnt > mid){
                max = mid - 1;
                // 否则后半部分必有重复
            } else {
                min = mid + 1;
            }
        }

        return min;

    }
};