Python DP Solution

  • 0
    class Solution(object):
        def findAllConcatenatedWordsInADict(self, words):
            :type words: List[str]
            :rtype: List[str]
            def wordBreak(word, cands):
                if not cands:
                    return False
                dp = [False] * (len(word) + 1)
                dp[0] = True
                for i in range(1, len(word) + 1):
                    for j in reversed(range(0, i)):
                        if not dp[j]:
                        if word[j:i] in cands:
                            dp[i] = True
                return dp[-1]
            words.sort(key=lambda x: -len(x))
            cands = set(words)
            ans = []
            for i in range(0, len(words)):
                cands -= {words[i]}
                if wordBreak(words[i], cands):
                    ans += words[i],
            return ans

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.