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

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @return int整型
#
class Solution:
    def minNumberDisappeared(self , nums: List[int]) -> int:
        # write code here
        nums.sort()
        i = 0
        while i < len(nums):
            k = 1
            while nums[i] < 1:
                i+=1
            while i<len(nums):
                if nums[i] == k:
                    i+=1
                    k+=1
                else:
                    break
            if k!=nums[-1]:
                return k
            else:
                return k+1