Given an array nums of n integers where each value is in the range [1, n], return all integers in [1, n] that do not appear in nums.
Input: An integer array nums of length n with values in [1, n].
Output: Sorted list of integers in [1, n] that don't appear in nums.
Input: [4,3,2,7,8,2,3,1]
Output: [5,6]
Explanation: n=8. Present: {1,2,3,4,7,8}. Missing from [1..8]: 5,6.Input: [1,1]
Output: [2]
Explanation: n=2. 1 appears twice, 2 never → missing: [2].Input: [1,2]
Output: []
Explanation: n=2. Both 1 and 2 present → nothing missing.n == nums.length1 <= n <= 10^51 <= nums[i] <= n