Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 448 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 448 # by problem number
lcpy gen -s find_all_numbers_disappeared_in_an_array # by problem name
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.
Input: nums = [4,3,2,7,8,2,3,1]
Output: [5,6]
Input: nums = [1,1]
Output: [2]
n == nums.length1 <= n <= 10^51 <= nums[i] <= nO(n) runtime? You may assume the returned list does not count as extra space.
class Solution:
# Time: O(n)
# Space: O(1) excluding the output list
def find_disappeared_numbers(self, nums: list[int]) -> list[int]:
for num in nums:
index = abs(num) - 1
if nums[index] > 0:
nums[index] = -nums[index]
return [i + 1 for i, num in enumerate(nums) if num > 0]
| Time | Space |
|---|---|
| O(n) | O(1) excluding the output list |