Skip to content

Latest commit

 

History

History
 
 

0047.permutations-ii

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

题目

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example, [1,1,2] have the following unique permutations:

[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

解题思路

本题和46. Permutations的区别在于,存在重复的数字。根据46题思路,同一个cur下,已经使用过的数字,就不能再使用了。即可。

总结