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]

我想了半天也没想到，怎样才能又不用其余的空间又能一次遍历就搞定。只好多用了一个数组空间。

public List<Integer> findDuplicates(int[] nums) {
		List<Integer> res=new ArrayList<Integer>();
		int[] newNums=new int[nums.length+1];
		for(int i=0;i<nums.length;i++){
			newNums[nums[i]]++;
		}
		for(int i=1;i<newNums.length;i++){
			if(newNums[i]==2){
				res.add(i);
			}
		}
		return res;
	}

然后看大神们的方法，真是太机智了。i遍历，使location=nums[i]，如果nums[location]为正数，则翻转变成负数，如果nums[location]为负数，说明之前已经翻转过，则该location已出现了2次，因为题目中说不是1次就是2次，所以可以将这个location加到list上。

public class Solution {
    // when find a number i, flip(翻转) the number at position i-1 to negative. 
    // if the number at position i-1 is already negative, i is the number that occurs twice.
    
    public List<Integer> findDuplicates(int[] nums) {
        List<Integer> res = new ArrayList<>();
        for (int i = 0; i < nums.length; ++i) {
            int index = Math.abs(nums[i])-1;
            if (nums[index] < 0)
                res.add(Math.abs(index+1));
            nums[index] = -nums[index];
        }
        return res;
    }
}