[LeetCode] 139. Word Break

题目内容

https://leetcode-cn.com/problems/word-break/

iven 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

 

---

题目思路

这道题目可以采用动态规划的方法来做。题目所要求的是给出的字符串是否可以被字典中的单词所表示。所以我们可以对字符串进行分解。从头开始进行检测，找到一个可以被字典所表示的部分[0:i]，然后把i插入动态规划list中，表示到i位置的字符串都可以被表示出来。然后下一次可以从0，或者i+1去求解。直到检测完所有的字符串。如果动态规划数组中包括了len(s)-1，则说明可以表示全部的字符串。

---

程序代码

class Solution(object):
    def wordBreak(self, s, wordDict):
        """
        :type s: str
        :type wordDict: List[str]
        :rtype: bool
        """
        l=len(s)
        dp=[-1]
        for i in range(l):
            for j in dp:
                if s[j+1:i+1] in wordDict:
                    dp.append(i)
                    break
        return dp[-1]==l-1