442. 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?

Example:

Input:
[4,3,2,7,8,2,3,1]

Output:
[2,3]

方法1:

和 Find the Duplicate Number类似。由于要求O(1)空间，需要用一个方法原位修改来标记一个数字已经出现。这时1<=a[i] <= n就很重要了，我们将出现过的数字对应元素标记为负，再次出现时会在对应位置发现负数，说明重复。

class Solution {
public:
    vector<int> findDuplicates(vector<int>& nums) {
        vector<int> result;
        for (int i = 0; i < nums.size(); i ++) {
            int idx = abs(nums[i]) - 1;
            if (nums[idx] < 0) result.push_back(idx + 1);
            nums[idx] = -nums[idx];
        }   
        return result;
    }
};