1539. 第 k 个缺失的正整数(LeetCode-力扣-Python)

class Solution(object):
    def findKthPositive(self, arr, k):
        """
        :type arr: List[int]
        :type k: int
        :rtype: int
        """
        sum = 0
        j = 0
        for i in range(1, len(arr)+k+1):
            if j<len(arr) and arr[j] == i:
                j += 1
                continue
            sum += 1
            if sum == k:
                return i