题解 | #缺失的第一个正整数#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 给定一个无重复元素的整数数组nums，请你找出其中没有出现的最小的正整数
# @param nums int整型一维数组
# @return int整型
#
class Solution:
    def minNumberDisappeared(self, nums: List[int]) -> int:
        nums.sort()
        lastNum = 0
        isFound = False
        for index, item in enumerate(nums):
            if item <= 0:
                continue

            else:
                if item - lastNum == 1:
                    lastNum = item
                else:
                    isFound = True
                    lastNum = lastNum + 1
                    break

        if not isFound:
            return nums[-1] + 1
        else:
            return lastNum