# 287. Find the Duplicate Number

109人阅读 评论(0)

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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

public class Solution {
public int findDuplicate(int[] nums) {
int low = 1; int high = nums.length-1;

while(low<high){

int mid = low + (high-low)/2;
int cnt = 0;
for(int num:nums){
if(num <= mid)
cnt++;
}
if(cnt <= mid)
{
low = mid+1;
}else{
high = mid;
}

}
return low;
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：133337次
• 积分：4043
• 等级：
• 排名：第7984名
• 原创：282篇
• 转载：7篇
• 译文：0篇
• 评论：8条
评论排行
最新评论