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

“树支” -> ”树枝“

Browse Source
This commit is contained in:
bqlin
2021-12-19 11:54:22 +08:00
parent 440f94447a
commit 9e70fbc528
5 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/周总结/20201107回溯周末总结.md
View File

@ -50,7 +50,7 @@ for (int i = startIndex; i < candidates.size() && sum + candidates[i] <= target;
我在图中将used的变化用橘黄色标注上，可以看出在candidates[i] == candidates[i - 1]相同的情况下：
* used[i - 1] == true，说明同一树支candidates[i - 1]使用过
* used[i - 1] == true，说明同一树枝candidates[i - 1]使用过
* used[i - 1] == false，说明同一树层candidates[i - 1]使用过
**这块去重的逻辑很抽象，网上搜的题解基本没有能讲清楚的，如果大家之前思考过这个问题或者刷过这道题目，看到这里一定会感觉通透了很多！**