Find All Numbers Disappeared in an Array

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

Example:

Input:
[4,3,2,7,8,2,3,1]

Output:
[5,6]

思路：不能用额外空间，而且还是O（N），那就是要modify existing array，算法就是取绝对值之后，标注负数，然后第二遍扫一遍的时候，如果哪个index位上面是正数，就是缺少的数。

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> list = new ArrayList<Integer>();
        if(nums == null || nums.length == 0) return list;
        
        for(int i=0; i<nums.length; i++) {
            int index = Math.abs(nums[i]);
            if(nums[index-1] > 0) {
                nums[index-1] = -nums[index-1];
            }
        }
        
        for(int i=0; i<nums.length; i++) {
            if(nums[i] > 0) {
                list.add(i+1);
            }
        }
        return list;
    }
}