find-all-numbers-disappeared-in-an-array_448.py

# 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.

# Example 1:

# Input: nums = [4,3,2,7,8,2,3,1]
# Output: [5,6]
# Example 2:

# Input: nums = [1,1]
# Output: [2]


# Constraints:

# n == nums.length
# 1 <= n <= 105
# 1 <= nums[i] <= n

# ---------------------------------------Runtime 269 ms Beats 98.13% Memory 27.4 MB Beats 31.15%---------------------------------------


from typing import List


class Solution:
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
        nums_set = set(nums)
        return [i for i in range(1, len(nums) + 1) if i not in nums_set]