mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 19:53:12 +08:00 
			
		
		
		
	add leetcode problem-cn part2
This commit is contained in:
		@@ -0,0 +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 = "qqe"
 | 
			
		||||
<strong> Output</strong>: ["eqq","qeq","qqe"]
 | 
			
		||||
</pre>
 | 
			
		||||
 | 
			
		||||
<p><strong>Example2:</strong></p>
 | 
			
		||||
 | 
			
		||||
<pre>
 | 
			
		||||
<strong> Input</strong>: S = "ab"
 | 
			
		||||
<strong> Output</strong>: ["ab", "ba"]
 | 
			
		||||
</pre>
 | 
			
		||||
 | 
			
		||||
<p><strong>Note:</strong></p>
 | 
			
		||||
 | 
			
		||||
<ol>
 | 
			
		||||
	<li>All characters are English letters.</li>
 | 
			
		||||
	<li><code>1 <= S.length <= 9</code></li>
 | 
			
		||||
</ol>
 | 
			
		||||
		Reference in New Issue
	
	Block a user