题目描述:
题解:动态规划
参考:https://segmentfault.com/a/1190000023020706
1.dp[i]表示s中前i个字符构成的字符串可否拆分为wordDict中的单词。dp初始化为全部False,dp[0]=True(dp长度为len(s)+1)
2.i从0开始到len(s),将s[0:i]分为两部分:s[0:j] s[j:i],dp[i]为True还是False由这两部分共同决定,如果dp[j]=True,则说明s[0:j]部分可以拆分为wordDict中内容,如果s[j:i]在wordDict存在则dp[i]=True
3.返回结果dp[length]
class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: length = len(s) dp = [False for i in range(length + 1)] dp[0] = True for i in range(1, length + 1): for j in range(i): dp[i] = dp[j] and s[j:i] in wordDict if dp[i]: break return dp[-1]