Problem Description:
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: 2Example 2:
Input: [3,1,3,4,2] Output: 3Note:
- 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.
Analysis:
本题思路是遍历1~n所有的数,找到那个重复次数大于1次的数然后终止程序。代码如下:
Code:
class Solution {
public int findDuplicate(int[] nums) {
for(int i = 1; i <= nums.length; i++) {
int cnt = 0;
for(int j = 0; j < nums.length; j++) {
if(i == nums[j]) {
cnt++;
if(cnt > 1)
return i;
}
}
}
return 0;
}
}