coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-14 03:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
算法题（国内版）/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html Normal file
View File

@@ -0,0 +1,22 @@
<p>Write a method to compute all permutations of a string of unique characters.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: S = &quot;qwe&quot;
<strong> Output</strong>: [&quot;qwe&quot;, &quot;qew&quot;, &quot;wqe&quot;, &quot;weq&quot;, &quot;ewq&quot;, &quot;eqw&quot;]
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: S = &quot;ab&quot;
<strong> Output</strong>: [&quot;ab&quot;, &quot;ba&quot;]
</pre>
<p><strong>Note:</strong></p>
<ol>
<li>All charaters are English letters.</li>
<li><code>1 &lt;= S.length &lt;= 9</code></li>
</ol>