更新LC139 单词拆分 回溯+记忆的逻辑 java #1146
Merged
+21
−17
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
经过提交验证，其实memo[startIndex] = 1的这个逻辑根本没有用到，因为如果返回true，那么会如同dfs一样直接返回，不会再进行下一步的backtracking搜索，本题的记忆法核心是令memo[startIndex]置为-1，来避免从相同的startIndex开始拆分，导致程序进行大量重复运算，这应该也是本题剪枝方法的核心。
|
收到 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
经过提交验证，其实memo[startIndex] = 1的这个逻辑根本没有用到，因为如果返回true，那么会如同dfs一样直接返回，不会再进行下一步的backtracking搜索，本题的记忆法核心是令memo[startIndex]置为-1，来避免从相同的startIndex开始拆分，导致程序进行大量重复运算，这应该也是本题剪枝方法的核心。carl哥有时间也可以把文章里自己写的c++版本改一下~