139 单词拆分class Solution: def wordBreak(self, s: str, wordDict: List[str]) - bool: wordset(wordDict) nlen(s) max_lenmax(map(len,wordDict)) f[True][False]*n for 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]True break return f[n]300 最长递增子序列class Solution: def lengthOfLIS(self, nums: list[int]) - int: f[0]*len(nums) for i,x in enumerate(nums): for j,y in enumerate(nums[:i]): if xy:f[i]max(f[i],f[j]) f[i]1 return max(f)