leetcode 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.

分析：
可以从前向后依次判断，当前位置i之前的字符串是否在字典内，如果在就判断之后的是否在。若最后一个位置为true，则说明两者都在。
code：

def wordbreak(s, worddict):
    if len(wordDict) == 0:
            return False
        n = len(s)
        dp = [False] * (n+1)
        dp[0] = True
        for i in range(1, n+1):
            for j in range(i):
                if dp[j]:
                    subword = s[j:i]
                    if subword in wordDict:
                        dp[i] = True
                        break
        return dp[n]