Rockwall

导航

2016年8月11日 #

LeetCode 【31. Next Permutation】

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文

posted @ 2016-08-11 19:56 Rockwall 阅读(290) 评论(0) 推荐(0)

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 pe 阅读全文

posted @ 2016-08-11 19:37 Rockwall 阅读(717) 评论(0) 推荐(0)

LeetCode 【46. Permutations】

摘要： Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations: 代码 阅读全文

posted @ 2016-08-11 17:30 Rockwall 阅读(239) 评论(0) 推荐(0)