[leetcode]442. Find All Duplicates in an Array

题目链接:https://leetcode.com/problems/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 ≤ a[i] ≤  n  ( n  = size of array),那么遍历nums,对每一个数n，如果n第一次出现，nums[n-1]=-nums[n-1],当n第二次出现时，检测nums[n-1]是否为负数，如果为负数，则n为重负出现。

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