Skip to content
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Create: 41-First-Missing-Positive.py
  • Loading branch information
UdayGarg committed Oct 2, 2022
commit 403c0feed846bb61d9eee84db53766bd6d23746b
27 changes: 27 additions & 0 deletions python/41-First-Missing-Positive.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution:
def firstMissingPositive(self, nums: List[int]) -> int:
A = nums
for i in range(len(A)):
if A[i] < 0:
A[i] = 0

for i in range(len(A)):
val = abs(A[i])
if 1 <= val <= len(A):
if A[val - 1] > 0:
A[val - 1] *= -1
elif A[val - 1] == 0:
A[val - 1] = -1 * (len(A) + 1)

for i in range( 1, len(A)+ 1):
if A[i -1] >= 0:
return i

return len(A) + 1

def firstMissingPositive_2(self, nums: List[int]) -> int:
new = set(nums)
i = 1
while i in new:
i += 1
return i