Posted on 2023-03-06 19:38
Uriel 閱讀(39)
評論(0) 編輯 收藏 引用 所屬分類:
閑來無事重切Leet Code
給出一列已經(jīng)單調(diào)遞增排序的數(shù)列，輸出缺失的第K小的數(shù)
Input: arr = [2,3,4,7,11], k = 5
Output: 9
Input: arr = [1,2,3,4], k = 2
Output: 6
水題
1 #1539
2 #Runtime: 34 ms (Beats 74.54%)
3 #Memory: 13.5 MB (Beats 56.83%)
4
5 class Solution(object):
6 def findKthPositive(self, arr, k):
7 """
8 :type arr: List[int]
9 :type k: int
10 :rtype: int
11 """
12 t, p = 0, 0
13 for i in arr:
14 p += 1
15 while p < i:
16 t += 1
17 if t == k:
18 return p
19 p += 1
20 while t < k:
21 t += 1
22 p += 1
23 return p