题目:
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.
这道题太高深了,参见这里的解法
C++版:
class Solution {
public:
int findDuplicate(vector<int>& nums) {
int low = 0, high = nums.size() - 1;
while(low <= high) {
int 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 - 1;
else
low = mid + 1;
}
return low;
}
};
Python版:
class Solution(object):
def findDuplicate(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
low, high = 0, len(nums) - 1
while low <= high:
mid = (low + high) / 2
cnt = sum(x <= mid for x in nums)
if cnt > mid:
high = mid - 1
else:
low = mid + 1
return low