Computer Science/Coding Test
LeetCode: 140. Word Break II
focalpoint
2021. 11. 22. 10:06
class Solution:
def wordBreak(self, s: str, wordDict: List[str]) -> List[str]:
self.wordDict = set(wordDict)
self.ret = []
self.dfs(s, [])
return self.ret
def dfs(self, s, path):
if not s:
self.ret.append(' '.join(path))
return
for word in self.wordDict:
k = len(word)
if s[:k] == word:
self.dfs(s[k:], path+[word])