Question
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example, [1,1,2] have the following unique permutations:
|
|
Explanation
和之前一道题相似,只是注意一下这里是可以重复的。
Code
|
|
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example, [1,1,2] have the following unique permutations:
|
|
和之前一道题相似,只是注意一下这里是可以重复的。
|
|