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

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
leetcode-cn/problem (English)/有重复字符串的排列组合(English) [permutation-ii-lcci].html
View File

@@ -1,22 +1,22 @@
<p>Write a method to compute all permutations of a string whose characters are not necessarily unique. The list of permutations should not have duplicates.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: S = &quot;qqe&quot;
<strong> Output</strong>: [&quot;eqq&quot;,&quot;qeq&quot;,&quot;qqe&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 characters are English letters.</li>
<li><code>1 &lt;= S.length &lt;= 9</code></li>
</ol>
<p>Write a method to compute all permutations of a string whose characters are not necessarily unique. The list of permutations should not have duplicates.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: S = &quot;qqe&quot;
<strong> Output</strong>: [&quot;eqq&quot;,&quot;qeq&quot;,&quot;qqe&quot;]
</pre>
<p><strong>Example2:</strong></p>