Re: [闲聊] 每日leetcode

楼主: DJYOSHITAKA (Evans)   2024-05-22 22:55:59
又被python的pass by reference搞死
然后原本送第一版写注解那样 只赢5%
改成现在这样就正常了
我还是不懂差在哪 姆咪
def partition(self, s: str) -> List[List[str]]:
ans = []
def dfs(idx, cur_list):
if idx == len(s):
ans.append(cur_list)
return
idx_r = idx
while idx_r<len(s):
if s[idx:idx_r+1] == s[idx:idx_r+1][::-1]:
# cur_list_next = copy.deepcopy(cur_list)
# cur_list_next.append(s[idx:idx_r+1])
# dfs(idx_r+1, cur_list_next)
dfs(idx_r+1, cur_list + [s[idx:idx_r+1]])
idx_r += 1
dfs(0,[])
return ans
作者: NTUtriangle (国立台湾大学联盟)   2024-05-22 22:56:00
大师
作者: cities516 (安安路过)   2024-05-22 22:59:00
别卷了

Links booklink

Contact Us: admin [ a t ] ucptt.com