Find All Numbers Disappeared in An Array
You are given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
Note: You can return the integers in any order.
Example 1:
Input: nums = [4,3,2,7,8,2,3,1]
Output: [5,6]Example 2:
Input: nums = [1,1]
Output: [2]Constraints:
1 <= nums[i] <= nums.length <= 100,000
Follow up: Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.