LeetCode 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]

解法

这道题与448类似，不过不是找只出现一次的数，而是找出现两次的数，不使用额外的空间，O(n)的时间复杂度。
使用正负号标记来确定该数字是否出现。遍历数组，记当前元素值的绝对值减一作为下标index：
当元素首次出现时，nums[index]乘以-1
当元素再次出现时，则nums[index]一定＜0

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