[LeetCode] 287. Find the Duplicate Number

Problem

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: 2

Example 2:

Input: [3,1,3,4,2]
Output: 3

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.

Solution

class Solution {
    public int findDuplicate(int[] nums) {
        //switch every k with nums[k-1], if nums[k-1] is also k, then found it
        int i = 0;
        while (i < nums.length) {
            if (i > 0 && nums[i] == nums[i-1]) return nums[i];
            while (i > 0 && nums[i] != i+1) {
                int j = nums[i]-1;
                if (nums[j] == nums[i]) return nums[i];
                else {
                    swap(nums, i, j);
                    i--;
                }
            }
            i++;
        }
        return -1;
    }
    private void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}
阅读 567

推荐阅读
Road to Glory
用户专栏

對酒當歌,人生幾何?譬如朝露,去日苦多。

22 人关注
639 篇文章
专栏主页