2026/10/5 2:31:40
2026.10.3
139 单词拆分class Solution:def wordBreak(self, s: str, wordDict: List[str]) -> bool:wordset(wordDict)nlen(s)max_lenmax(map(len,wordDict))f[True][False]*nfor i in range(1,n1):for j in range(i-1,max(-1,i-1-max_len),-1):if f[j] and s[j:i] in word:f[i]Trueb…