Re: [閒聊] 每日leetcode
空窗期真的很恐怖
我已經不懂程式了哀
連easy都要WA幾次 吐了
def getLongestSubsequence(self, words, groups):
"""
:type words: List[str]
:type groups: List[int]
:rtype: List[str]
"""
pre_group = groups[0]
cur_ans = [words[0]]
for i in range(1, len(words)):
if groups[i] != pre_group:
cur_ans.append(words[i])
pre_group = groups[i]
return cur_ans
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 1.21.119.51 (日本)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1747281585.A.D7A.html
推
05/15 12:00,
6月前
, 1F
05/15 12:00, 1F
推
05/15 12:03,
6月前
, 2F
05/15 12:03, 2F
→
05/15 12:05,
6月前
, 3F
05/15 12:05, 3F
→
05/15 12:06,
6月前
, 4F
05/15 12:06, 4F
→
05/15 12:07,
6月前
, 5F
05/15 12:07, 5F
→
05/15 12:07,
6月前
, 6F
05/15 12:07, 6F
→
05/15 12:08,
6月前
, 7F
05/15 12:08, 7F
→
05/15 12:08,
6月前
, 8F
05/15 12:08, 8F
討論串 (同標題文章)
完整討論串 (本文為第 1428 之 1549 篇)：