Leetcode. Find All Duplicates in an Array

Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements that appear twice in this array.

Could you do it without extra space and in O(n) runtime?




Time complexity: O(N)
Space complexity: O(1)

public class Solution {
    public List<Integer> findDuplicates(int[] nums) {
        if (nums == null || nums.length == 0){
            return new ArrayList<Integer>();
        List<Integer> res = new ArrayList<Integer>();
        for (int n : nums){
            int idx = Math.abs(n);
            if (nums[idx-1] < 0){
            nums[idx-1] = ~nums[idx-1] + 1;
        //restore array
        for (int i = 0; i < nums.length; ++i){
            nums[i] = Math.abs(nums[i]);
        return res;

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s