448. Find All Numbers Disappeared in an Array[Easy]

Description

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]

Solotion

• We could find the relationship between index and element.

• When we get an element such as k, we could mark the (k-1)th element as a negative number if it’s positive. After an iteration, assume that the mth element is a positive number, which means number m + 1 doesn’t appear in this array.

• There is still a confusion for me: why the description mentions that some elements appear twice and others appear once, which means no elements will appear more than twice.

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