# 全排列 II

<p>给定一个可包含重复数字的序列 <code>nums</code> ，<strong>按任意顺序</strong> 返回所有不重复的全排列。</p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>nums = [1,1,2]<strong><br />输出：</strong>[[1,1,2], [1,2,1], [2,1,1]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>nums = [1,2,3]<strong><br />输出：</strong>[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= nums.length <= 8</code></li>	<li><code>-10 <= nums[i] <= 10</code></li></ul>

## template

```python
from typing import List
class Solution:
	def permuteUnique(self, nums: List[int]) -> List[List[int]]:
		ans = []
		if len(nums) == 0:
			return
		if len(nums) == 1:
			return [nums]
		for index,item in enumerate(nums):
			res = nums[:index]+nums[index+1:]
			for j in self.permuteUnique(res): 
				ans.append(j+[item])
		rel = []
		for i in ans:
			if i not in rel:
				rel.append(i)
		return rel
# %%
s = Solution()
print(s.permuteUnique(nums = [1,2,3]))
```

## 答案

```python

```

## 选项

### A

```python

```

### B

```python

```

### C

```python

```