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

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-12-10 08:36:40 +08:00
parent 441de1ebf5
commit 71fb7b9b1d
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
pics/46.全排列.png
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 230 KiB

After

Width:  |  Height:  |  Size: 232 KiB

6
problems/0046.全排列.md
View File

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