leetcode 287: Find the Duplicate Number

Find the Duplicate Number

Total Accepted: 1340 Total Submissions: 4766 Difficulty: Hard

Given an array nums containing n + 1 integers where each integer is between 1 andn (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.

Note:

1. You must not modify the array (assume the array is read only).
2. You must use only constant, O(1) extra space.
3. Your runtime complexity should be less than O(n2).
4. There is only one duplicate number in the array, but it could be repeated more than once.

[思路]

二分查找,    1..10,,    小于等于5的一定有5个,如果多于5个,就在lower part, 等于5个就是upper part.

[CODE]

public class Solution {    public int findDuplicate(int[] nums) {        int n = nums.length-1;        int low = 1, high= n;        int mid = 0;        while(low<high) {            mid = low + (high-low)/2;            int c= count(nums, mid); //count #numbers less than mid.            if(c<=mid) {                low = mid+1;            } else {                high = mid;            }        }        return low;    }        private int count(int[] nums, int mid) {        int c =0;        for(int i=0; i<nums.length; i++) {            if(nums[i]<=mid) c++;        }        return c;    }}