[array-java]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]

Accepted
139,686
Submissions
217,521

answer one

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

直接看没看出来，纸上画一遍就懂了，因为value是在array.length的index范围内的，所以遍历数组，把每个value作为下标取出对应的值，置为负数。然后如果有哪个value重复了，对应的index的值一定是负的，那这个值就可以取出来了。

why God. Why. why can’t I have smart brain like this.

answer two

public class Solution {

public List<Integer> findDuplicates(int[] nums) {
     List<Integer> result = new ArrayList<Integer>();
    if(nums == null)
        return result;
    for(int i=0; i<nums.length; i++){
        int location = Math.abs(nums[i])-1;
        if(nums[location] < 0){
            result.add(Math.abs(nums[i]));
        }else{
            nums[location] = -nums[location];
        }
    }
    for(int i=0; i<nums.length; i++)
        nums[i] = Math.abs(nums[i]);
   
    return result;
}

}