139.单词拆分
class Solution:
def wordBreak(self, s: str, wordDict: List[str]) -> bool:
#dp[j]:字符串长度为j的话,能被字典中的单词组成的话,dp[j]为True
# s: 背包容量, wordDict:物品
#初始化
dp = [False] * (len(s) + 1)
dp[0] = True
#遍历顺序(排列问题,先背包后物品)
for i in range(1,len(s)+1):
for j in range(i): #这个边界要注意
if dp[j] and s[j:i] in wordDict:
dp[i] = True
return dp[-1]