[LeetCode][Python3] 41. First Missing Positive

Problem :

https://leetcode.com/problems/first-missing-positive/

My Solution :

class Solution:

def firstMissingPositive(self, nums: List[int]) -> int:

i = 0

while i < len(nums):

if (0 < nums[i] <= len(nums) and

nums[i] != nums[nums[i]-1]):

nums[nums[i]-1], nums[i] = nums[i], nums[nums[i]-1]

i -= 1

i += 1

i = 0

while i < len(nums):

if nums[i] != i+1:

return i+1

i += 1

return i+1