DFS：排列数字

public class test1 {

	static int num = 0;
	int u = 1;
	boolean[] status = new boolean[10];
	int[] path = new int[10];
	
	
	public void dfs(int n) {
		
		if(n > num)
		{
			for(int i = 1;i < n;i++) System.out.print(path[i]+" ");
			System.out.print("\n");			
			return; 
		}
		
		for(int i = 1;i <= test1.num;i++)
		{
			if(status[i] == false)
			{
				path[n] = i;
				status[i] = true;
				dfs(n+1);
				status[i] = false;
			}
		}
	}
	
	public static void main(String arg[]) {
		test1 t = new test1();
		test1.num = 9;
		t.dfs(1);
	}
	
	

}