2016年3月11日
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 pe 阅读全文
posted @ 2016-03-11 20:56 YuriFLAG 阅读(132) 评论(0) 推荐(0)
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,1,3 阅读全文
posted @ 2016-03-11 20:39 YuriFLAG 阅读(229) 评论(0) 推荐(0)
Next Permutation
摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2016-03-11 08:47 YuriFLAG 阅读(156) 评论(0) 推荐(0)