Commit de7879f

authored

Update 0139.单词拆分.md

1 parent d8c51b2 commit de7879fCopy full SHA for de7879f

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -369,8 +369,8 @@ class Solution:`
`369`	`369`	`dp = [False] * (n + 1) # dp[i] 表示字符串的前 i 个字符是否可以被拆分成单词`
`370`	`370`	`dp[0] = True # 初始状态,空字符串可以被拆分成单词`
`371`	`371`
`372`		`- for i in range(1, n + 1):`
`373`		`- for j in range(i):`
	`372`	`+ for i in range(1, n + 1):# 遍历背包`
	`373`	`+ for j in range(i):# 遍历单词`
`374`	`374`	`if dp[j] and s[j:i] in wordSet:`
`375`	`375`	`dp[i] = True # 如果 s[0:j] 可以被拆分成单词,并且 s[j:i] 在单词集合中存在,则 s[0:i] 可以被拆分成单词`
`376`	`376`	`break`

Comments

(0)