2016年7月15日
47. Permutations II java solutions
摘要： 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-07-15 09:13 Miller1991 阅读(301) 评论(0) 推荐(0)
60. Permutation Sequence java solutions
摘要： The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order,We get the following sequence 阅读全文
posted @ 2016-07-15 08:41 Miller1991 阅读(352) 评论(0) 推荐(0)