LeetCode 448. 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]

找出1~n中没有出现过的数字.
要求时间复杂度为o(n)，不适用额外空间

我最先想到的就是把数字放到他对应位置上，剩下的就是没出现过得数字

public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> list = new ArrayList<>();
        int length = nums.length;
        int i = 0;
        while (i < length) {
            if(nums[i] == -1){
                i++;
                continue;
            }
            //当前数不在正确位置
            if (nums[i] != i+1) {
                //交换的不相等
                if (nums[nums[i] - 1] != nums[i]) {
                    swap(nums, nums[i]-1, i);
                } else {
                    nums[i] = -1;
                    i++;
                }
            }else i++;
        }
        for (int j = 0; j < length; j++) {
            if(nums[j] == -1) list.add(j + 1);
        }
        return list;
    }
     public void swap(int[] nums, int i, int j) {
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }

但觉得这个方法还是有点low，然后网上的一个取负的方法令我脑洞大开
总结一些方法:如果n出现过，那么num[n-1]上的数就是负的。那么如果num[i]是正数，说明i+1正数不存在，十分巧妙啊

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

    }