leetcode刷题笔记(python3)--139. Word Break

139. Word Break

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

Note:

The same word in the dictionary may be reused multiple times in the segmentation.
You may assume the dictionary does not contain duplicate words.
Example 1:

Input: s = “leetcode”, wordDict = [“leet”, “code”]
Output: true
Explanation: Return true because “leetcode” can be segmented as “leet code”.
Example 2:

Input: s = “applepenapple”, wordDict = [“apple”, “pen”]
Output: true
Explanation: Return true because “applepenapple” can be segmented as “apple pen apple”.
Note that you are allowed to reuse a dictionary word.
Example 3:

Input: s = “catsandog”, wordDict = [“cats”, “dog”, “sand”, “and”, “cat”]
Output: false

解题思路花花酱

python3过不了，但是测试用例本地可以过，先mark一下

import collections
class Solution:
    mem = collections.defaultdict(bool)
    def wordBreak(self, s: str, wordDict: list) -> bool:
        wordSet = set(wordDict)
        return self.wordRecursive(s,wordSet)
    
    def wordRecursive(self, s:str,wordSet : set) -> bool:
        if self.mem[s]:
            return self.mem[s]
        if s in wordSet:
            self.mem[s] = True
            return True
        for i,_ in enumerate(s):
            left = s[:i]
            right = s[i:]
            if (right in wordSet) and self.wordRecursive(left,wordSet):
                self.mem[s]=True
                return True
        self.mem[s] = False
        return False