algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 11:34:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0139.单词拆分.md

Browse Source
This commit is contained in:
jianghongcheng
2023-06-05 03:12:19 -05:00
committed by GitHub
parent d8c51b2d36
commit de7879f26e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0139.单词拆分.md
View File

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