You are given an array with all the numbers from 1 to N appearing exactly once, except for two number that is missing. How can you find the missing number in O(N) time and 0(1) space?

You can return the missing numbers in any order.

Example 1:

Input: [1]

Output: [2,3]

Example 2:

Input: [2,3]

Output: [1,4]

Note:

• nums.length <= 30000