github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0047.全排列II.md
View File

@@ -48,7 +48,7 @@
我以示例中的 [1,1,2]为例 （为了方便举例，已经排序）抽象为一棵树，去重过程如图：
![47.全排列II1](https://code-thinking-1253855093.file.myqcloud.com/pics/20201124201331223.png)
![47.全排列II1](https://file.kamacoder.com/pics/20201124201331223.png)
图中我们对同一树层，前一位（也就是nums[i-1]）如果使用过，那么就进行去重。
@@ -130,11 +130,11 @@ if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == true) {
树层上去重(used[i - 1] == false)，的树形结构如下：
![47.全排列II2](https://code-thinking-1253855093.file.myqcloud.com/pics/20201124201406192.png)
![47.全排列II2](https://file.kamacoder.com/pics/20201124201406192.png)
树枝上去重（used[i - 1] == true）的树型结构如下：
![47.全排列II3](https://code-thinking-1253855093.file.myqcloud.com/pics/20201124201431571.png)
![47.全排列II3](https://file.kamacoder.com/pics/20201124201431571.png)
大家应该很清晰的看到，树层上对前一位去重非常彻底，效率很高，树枝上对前一位去重虽然最后可以得到答案，但是做了很多无用搜索。