import java.util.ArrayList;
/**
* @Author:Aliyang
* @Data: Created in 上午9:39 18-6-14
* permutations：我的解法
* 思路：dfs，差点超时
**/
public class T104 {
ArrayList> res=new ArrayList<>();
public ArrayList> permute(int[] num) {
if (num.length==0)
return res;
ArrayList cur=new ArrayList<>();
boolean[] visit=new boolean[num.length];
recur(num,visit,cur,0);
return res;
}
private void recur(int[] num,boolean[] visit,ArrayList cur,int count){
ArrayList now=new ArrayList<>(cur);
if (count==num.length){
res.add(now);
return;
}
for (int i=0;i> res=t.permute(num);
for (ArrayList cur:res){
for (Integer a:cur){
System.out.print(a+",");
}
System.out.println();
}
}
}