题目:
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], [2,3,1], [3,1,2], [3,2,1] ]
题解:求满足条件的所有解,此类题目用递归,和39.40,18同类型题目
public List<List<Integer>> permute(int[] nums) {
if(nums==null||nums.length==0)
return null;
List<List<Integer>> lists=new ArrayList<List<Integer>>();
List<Integer> list=new ArrayList<Integer>();
getPermute(nums,0,lists,list);
return lists;
}
public void getPermute(int[]nums,int length,List<List<Integer>> lists,List<Integer> list){
if(length==nums.length){
lists.add(new ArrayList(list));
return;
}else{
for(int i=0;i<nums.length;i++){
if(!list.contains(nums[i])){
list.add(nums[i]);
getPermute(nums,length+1,lists,list);
list.remove(list.size()-1);
}
}
}
}