dsa · easy
Find All Numbers Disappeared in an Array
nums has length n. Every value is an integer in 1..n (values may repeat). Return every integer in 1..n that never appears, in any order. If every integer is present, return an empty list.
Arguments
nums— length-n array of values in 1..n; some integers in that range may be missing
Example
nums = [4,3,2,7,8,2,3,1]: 5 and 6 are missing → [5,6].
nums = [1,1] → [2].
Constraints
1 <= nums.length <= 5 * 10^4 1 <= nums[i] <= nums.length Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.
Examples
Example 1
Input: [4, 3, 2, 7, 8, 2, 3, 1] Expected: [5,6]
Example 2
Input: [1, 1] Expected: [2]