随笔分类 -  Permutation

60. Permutation Sequence
摘要：Base on next permutation: 阅读全文
posted @ 2017-09-26 03:56 Weiyu Wang 阅读(141) 评论(0) 推荐(0)
47. Permutations II
摘要：public class Solution { public List> permuteUnique(int[] nums) { List> ret=new ArrayList>(); Arrays.sort(nums); boolean[] used=new boolean[nums.length]; permute(ne... 阅读全文
posted @ 2017-09-25 08:07 Weiyu Wang 阅读(128) 评论(0) 推荐(0)
46. Permutations
摘要：public class Solution { public List> permute(int[] nums) { List> ret=new ArrayList>(); permute(new ArrayList(),ret,nums); return ret; } private void permute(List l... 阅读全文
posted @ 2017-09-25 07:51 Weiyu Wang 阅读(141) 评论(0) 推荐(0)
31. Next Permutation
摘要：class Solution { public void nextPermutation(int[] nums) { int i=nums.length-1; while(i>0&&nums[i-1]>=nums[i])i--; if(i==0) { Arrays.sort(nums); ... 阅读全文
posted @ 2017-09-23 07:33 Weiyu Wang 阅读(126) 评论(0) 推荐(0)