Re: [閒聊] 每日leetcode

作者: DJYOMIYAHINA (通通打死)   2025-07-25 21:57:11
還忘記subarray不能為空吃了一個WA
要是這是面試我已經死了
def maxSum(self, nums: List[int]) -> int:
a = set()
b = -1000
for num in nums:
if num>0 and num not in a:
a.add(num)
if num<=0 and num>b:
b = num
return sum(a) if len(a)>0 else b

Links booklink

Contact Us: admin [ a t ] ucptt.com