mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
23 lines
550 B
HTML
23 lines
550 B
HTML
<p>无重复字符串的排列组合。编写一种方法，计算某字符串的所有排列组合，字符串每个字符均不相同。</p>
|
||
|
||
<p> <strong>示例1:</strong></p>
|
||
|
||
<pre>
|
||
<strong> 输入</strong>：S = "qwe"
|
||
<strong> 输出</strong>：["qwe", "qew", "wqe", "weq", "ewq", "eqw"]
|
||
</pre>
|
||
|
||
<p> <strong>示例2:</strong></p>
|
||
|
||
<pre>
|
||
<strong> 输入</strong>：S = "ab"
|
||
<strong> 输出</strong>：["ab", "ba"]
|
||
</pre>
|
||
|
||
<p> <strong>提示:</strong></p>
|
||
|
||
<ol>
|
||
<li>字符都是英文字母。</li>
|
||
<li>字符串长度在[1, 9]之间。</li>
|
||
</ol>
|