全排列

上代码

 

public class WholeArrangement {
	
	private static int[] a = {1,2,3};
	private static int length = a.length;
	
	public static void dfs(int x){//深度优先搜索

		if(x == length){
			for(int i = 0;i<length;i++){
				System.out.print(a[i]+" ");
			}
			System.out.println();
		}else{
			for(int i = x;i<length;i++){
				int t;
				t = a[i];
				a[i] = a[x];
				a[x] = t;
				dfs(x+1);
				//换回来
				t = a[i];
				a[i] = a[x];
				a[x] = t;
			}
		}
		
	}
	
	public static void main(String[] args) {
		dfs(0);
	}
	
}

结果