LeetCode刷题【Array】 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 class Solution {
    public List<Integer> findDuplicates(int[] nums) {
        if(null==nums) return null;
		List<Integer> ret = new ArrayList<Integer>();
		for(int i=0;i<nums.length;i++){
			if(nums[i]==i+1) continue;
			while(nums[i]!=i+1&&nums[nums[i]-1]!=nums[i]){
				int j=nums[i]-1;
				nums[i]^=nums[j];
				nums[j]^=nums[i];
				nums[i]^=nums[j];
			}
		}
		for(int i=0;i<nums.length;i++){
			if(nums[i]!=i+1) ret.add(nums[i]);
		}
		return ret;
    }
}

解决方法二： 用特殊方法标记

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;
    }
}

参考：

【1】https://leetcode.com/