leetcode448. Find All Numbers Disappeared in an Array

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]

解法一

新建一个数组，纪录每个数字出现的个数。最后返回出现为0的该位置的值。

public class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> ret = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return ret;
        }

        int[] index = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            index[nums[i] - 1]++;
        }
        for (int i = 0; i < index.length; i++) {
            if (index[i] == 0) {
                ret.add(i + 1);
            }
        }

        return ret;
    }
}

解法二

主要对原数操作后数组会越界，所以要％len，％len之后又和原来的index一样。

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

        return ret;
    }
}

解法三

将原数变为负数，变为负数之后，因为改变了原数组的值，下次再出现就不用再变为负数。

public class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> ret = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return ret;
        }

        for (int i = 0; i < nums.length; i++) {
            if (nums[Math.abs(nums[i]) - 1] > 0) {
                nums[Math.abs(nums[i]) - 1] *= -1 ;
            }
        }
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > 0) {
                ret.add(i + 1);
            }
        }

        return ret;
    }
}