CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新图床

Browse Source
This commit is contained in:
programmercarl
2023-03-10 14:02:32 +08:00
parent 2a9b627a90
commit 17cb4b45c7
134 changed files with 1169 additions and 829 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/回溯算法去重问题的另一种写法.md
View File

@@ -16,7 +16,8 @@
我用没有排序的集合{2,1,2,2}来举例子画一个图，如图：
![90.子集II2](https://img-blog.csdnimg.cn/2020111316440479.png)
![90.子集II2](https://code-thinking-1253855093.file.myqcloud.com/pics/2020111316440479-20230310121930316.png)
图中，大家就很明显的看到，子集重复了。
@@ -96,7 +97,7 @@ private:
如图：
![90.子集II1](https://img-blog.csdnimg.cn/202011131625054.png)
![90.子集II1](https://code-thinking-1253855093.file.myqcloud.com/pics/202011131625054.png)
可以看出一旦把unordered_set<int> uset放在类成员位置，它控制的就是整棵树，包括树枝。