class Solution {
public:
int findDuplicate(vector<int>& nums) {
//示例1:[1, 3, 4, 2, 2]
//范围是[1, 5]
//在范围内使用二分算法
//(1 + 5) / 2 = 3,数组中小于等于2的有3个
//按照正常的不重复来说,小于3的应该只有1、2两个,那么说明重复的肯定小于3
//那么向左找,同理如果小于等于2个,那么向右找(这里需要标记本身,因为可能它本身就是重复的那个)
int left = 1, right = nums.size();
int n = nums.size();
int ans = 0;
while(left <= right){
//二分算法
int mid = (left + right) >> 1;
int times = 0; //小于mid的次数
for(int i = 0; i < n; ++i){
if(nums[i] < mid)
times++;
}
//正常的小于mid的次数应该 <= mid - 1,就往右找
//如果 >= mid 就往左找
if(times >= mid)
right = mid - 1;
else{
left = mid + 1;
ans = mid;
}
}
return ans;
}
};
Accepted
58/58 cases passed (112 ms)
Your runtime beats 37.84 % of cpp submissions
Your memory usage beats 37.73 % of cpp submissions (59.8 MB)