algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-07 15:01:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-04-24 04:12:17 +08:00
parent d7cc9582df
commit 6dd453ea39
3 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chapter_backtracking/permutations_problem/index.html
View File

@ -1851,7 +1851,8 @@
<h1 id="132">13.2. &nbsp; 全排列问题<a class="headerlink" href="#132" title="Permanent link">&para;</a></h1> <h1 id="132">13.2. &nbsp; 全排列问题<a class="headerlink" href="#132" title="Permanent link">&para;</a></h1>
<p>全排列问题是回溯算法的一个典型应用。它的定义是在给定一个集合（如一个数组或字符串）的情况下，找出这个集合中元素的所有可能的排列。</p> <p>全排列问题是回溯算法的一个典型应用。它的定义是在给定一个集合（如一个数组或字符串）的情况下，找出这个集合中元素的所有可能的排列。</p>
<p>如下表所示，展示了输入数组和对应的所有排列。</p> <p>如下表所示，列举了几个示例数组和其对应的所有排列。</p>
<div class="center-table">
<table> <table>
<thead> <thead>
<tr> <tr>
@ -1874,6 +1875,7 @@
</tr> </tr>
</tbody> </tbody>
</table> </table>
</div>
<h2 id="1321">13.2.1. &nbsp; 无重复的情况<a class="headerlink" href="#1321" title="Permanent link">&para;</a></h2> <h2 id="1321">13.2.1. &nbsp; 无重复的情况<a class="headerlink" href="#1321" title="Permanent link">&para;</a></h2>
<div class="admonition question"> <div class="admonition question">
<p class="admonition-title">输入一个整数数组，数组中不包含重复元素，返回所有可能的排列。</p> <p class="admonition-title">输入一个整数数组，数组中不包含重复元素，返回所有可能的排列。</p>

2
search/search_index.json
View File

File diff suppressed because one or more lines are too long

BIN
sitemap.xml.gz
View File

Binary file not shown.