README.md

442. Find All Duplicates in an Array (Medium)

Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.

You must write an algorithm that runs in O(n) time and uses only constant extra space.

 

Example 1:

Input: nums = [4,3,2,7,8,2,3,1]
Output: [2,3]

Example 2:

Input: nums = [1,1,2]
Output: [1]

Example 3:

Input: nums = [1]
Output: []

 

Constraints:

• n == nums.length
• 1 <= n <= 105
• 1 <= nums[i] <= n
• Each element in nums appears once or twice.

Companies:
Facebook, Amazon

Related Topics:
Array, Hash Table

Similar Questions:

• Find All Numbers Disappeared in an Array (Easy)

Solution 1.

// OJ: https://leetcode.com/problems/find-all-duplicates-in-an-array/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    vector<int> findDuplicates(vector<int>& A) {
        vector<int> ans;
        int i = 0, N = A.size();
        while (i < N) {
            if (A[i] == 0 || A[i] == i + 1) ++i;
            else if (A[i] == A[A[i] - 1]) {
                ans.push_back(A[i]);
                A[i++] = 0;
            } else swap(A[i], A[A[i] - 1]);
        }
        return ans;
    }
};