mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
21 lines
558 B
HTML
21 lines
558 B
HTML
|
<p>有重复字符串的排列组合。编写一种方法，计算某字符串的所有排列组合。</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong> 输入</strong>：S = "qqe"
|
|||
|
|
<strong> 输出</strong>：["eqq","qeq","qqe"]
|
|||
|
|
</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>
|