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

Update

Browse Source
This commit is contained in:
youngyangyang04
2021-11-11 01:34:12 +08:00
parent 124924dee2
commit a0de1660f6
10 changed files with 124 additions and 115 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -40,7 +40,7 @@
我以[1,2,3]为例，抽象成树形结构如下：
![46.全排列](https://img-blog.csdnimg.cn/20201209174225145.png)
![46.全排列](https://code-thinking-1253855093.file.myqcloud.com/pics/20211027181706.png)
### 回溯三部曲
@@ -52,7 +52,7 @@
但排列问题需要一个used数组，标记已经选择的元素，如图橘黄色部分所示:
![46.全排列](https://img-blog.csdnimg.cn/20201209174225145.png)
![46.全排列](https://code-thinking-1253855093.file.myqcloud.com/pics/20211027181706.png)
代码如下：