【leetcode】(python)139. Word Break词语分割

139. Word Break Medium

Description

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

• 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

题意

给定非空字符串s和包含非空字列表的字典wordDict，确定s是否可以被分段为一个或多个字典单词的空格分隔序列。

解题思路

如果要求一个问题的最优解（通常是最大值或者最小值），而且该问题能够分解成若干个子问题，并且小问题之间也存在重叠的子问题，则考虑采用动态规划。

该题遍历s看其中是否存在可分割的单词且在wordDict中，记录可分割的位置，那么各位置区间之间就是一个单词，看最后位置能否到达末尾，若可到达则True,否则False.

code

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

七夕，知到了不好的消息也要勇敢面对。