2015年5月24日
[LintCode] Permutations II
摘要： 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], an... 阅读全文
posted @ 2015-05-24 00:12 Acjx 阅读(669) 评论(0) 推荐(0)