First Missing Positive
Solution
Verifying access...
Time Complexity
O(n)SPACE_COMPLEXITY: O(1)---PYTHON---from typing import Listclass Solution:def firstMissingPositive(self, nums: List[int]) -> int:n = len(nums)for i in range(n):while 1 <= nums[i] <= n and nums[nums[i] - 1] != nums[i]:correct_idx = nums[i] - 1nums[i], nums[correct_idx] = nums[correct_idx], nums[i]for i in range(n):
Space Complexity
O(1)---PYTHON---from typing import Listclass Solution:def firstMissingPositive(self, nums: List[int]) -> int:n = len(nums)for i in range(n):while 1 <= nums[i] <= n and nums[nums[i] - 1] != nums[i]:correct_idx = nums[i] - 1nums[i], nums[correct_idx] = nums[correct_idx], nums[i]for i in range(n):