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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,22 +1,22 @@
<p>无重复字符串的排列组合。编写一种方法，计算某字符串的所有排列组合，字符串每个字符均不相同。</p>
<p> <strong>示例1:</strong></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>
<p><strong>示例 2：</strong></p>
<pre>
<strong> 输入</strong>：S = "ab"
<strong> 输出</strong>：["ab", "ba"]
</pre>
<p> <strong>提示:</strong></p>
<p><strong>提示：</strong></p>
<ol>
<li>字符都是英文字母。</li>
<li>字符串长度在[1, 9]之间。</li>
<li>字符都是英文字母。</li>
<li>字符串长度在[1, 9]之间。</li>
</ol>