JAVA实现n的全排列

package quanpailie;


import java.util.Scanner;


public class quanpailie {
//1,2,3,...,n的全排列
static int []d=new int[1000];
static int []v=new int[1000];
private static int num=0;
public static void main(String[] args) {
// TODO Auto-generated method stub


Scanner input=new Scanner(System.in);
num=input.nextInt();
for(int i=0;i<num;i++){
v[i]=0;
}
dfs(0);

}
static void dfs(int depth){
if(depth >= num){
for(int i=0;i!=num;i++){
System.out.print(d[i]);
}
System.out.println();
return ;
}
for(int i=1;i<=num;i++){
if(v[i] == 0){
v[i]=1;
d[depth]=i;
dfs(depth+1);
v[i]=0;
}
}

}


}