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/0046.全排列.md
View File

@@ -41,7 +41,7 @@
我以[1,2,3]为例，抽象成树形结构如下：
![全排列](https://code-thinking-1253855093.file.myqcloud.com/pics/20240803180318.png)
![全排列](https://file.kamacoder.com/pics/20240803180318.png)
### 回溯三部曲
@@ -53,7 +53,7 @@
但排列问题需要一个used数组，标记已经选择的元素，如图橘黄色部分所示:
![全排列](https://code-thinking-1253855093.file.myqcloud.com/pics/20240803180318.png)
![全排列](https://file.kamacoder.com/pics/20240803180318.png)
代码如下：
@@ -65,7 +65,7 @@ void backtracking (vector<int>& nums, vector<bool>& used)
* 递归终止条件
![全排列](https://code-thinking-1253855093.file.myqcloud.com/pics/20240803180318.png)
![全排列](https://file.kamacoder.com/pics/20240803180318.png)
可以看出叶子节点，就是收割结果的地方。