leetcode-problemset/leetcode-cn/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html

<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>