Re: [閒聊] 每日leetcode
記了一堆東西
總感覺可以省
等等洗澡有想到再來改
沒想到就算了
def maximumUniqueSubarray(self, nums: List[int]) -> int:
n = len(nums)
prefix_sum = [0 for _ in range(n)]
mp = {}
rets, cur_score, cur_sum, cur_start = -1, 0, 0, 0
for i, num in enumerate(nums):
cur_sum += num
prefix_sum[i] = cur_sum
if num not in mp:
mp[num] = i
cur_score += num
rets = max(cur_score, rets)
else:
cur_start = max(cur_start, mp[num])
cur_score = prefix_sum[i]-prefix_sum[cur_start]
rets = max(cur_score, rets)
mp[num] = i
return rets
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 220.132.58.28 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1753198724.A.8EB.html
推
07/22 23:39,
4月前
, 1F
07/22 23:39, 1F
推
07/22 23:48,
4月前
, 2F
07/22 23:48, 2F
討論串 (同標題文章)
完整討論串 (本文為第 1476 之 1549 篇)：