Runtime: 295 ms (Top 90.42%) | Memory: 28 MB (Top 72.11%)

Author: AnasImloul

scripts/algorithms/F/First Missing Positive/First Missing Positive.py

@@ -1,9 +1,10 @@
+# Runtime: 295 ms (Top 90.42%) | Memory: 28 MB (Top 72.11%)
 class Solution:
     def firstMissingPositive(self, nums: List[int]) -> int:
         mn = float('inf')
         mx = 0
         numsSet = set()
-        
+
         for i in range(len(nums) - 1, -1, -1):
             if nums[i] > 0:
                 if nums[i] < mn:
@@ -12,11 +13,11 @@ def firstMissingPositive(self, nums: List[int]) -> int:
                     mx = nums[i]
                 numsSet.add(nums[i])
             del nums[i]
-        
+
         if mn >= 2:
             return 1
         if len(numsSet) == mx:
             return mx + 1
         for i in range(2, len(numsSet) + 1):
             if i not in numsSet:
-                return i
+                return i