Fork me on GitHub
2017年3月8日
[leetcode-47-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 p 阅读全文
posted @ 2017-03-08 13:43 hellowOOOrld 阅读(199) 评论(0) 推荐(0)
[leetcode-46-Permutations]
摘要： Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2 阅读全文
posted @ 2017-03-08 11:00 hellowOOOrld 阅读(179) 评论(0) 推荐(0)