怪怪的題目
感覺有一些更聰明的解法==
應該至少可以binary search吧
不過有點懶得改了
def maxCount(self, banned: List[int], n: int, maxSum: int) -> int:
banned = set(banned)
cur_sum, cur_cnt = 0, 0
for i in range(1,n+1):
if i in banned:
continue
cur_sum += i
if cur_sum>maxSum:
return cur_cnt
cur_cnt += 1
return cur_cnt