全排列

public class Main {
	static int[] data = { 0, 1, 2 };
	static int ans = 0;
	static int n;

	public static void main(String[] args) {
		n = data.length;
		dfs(0);
		System.out.println(ans);
	}

	static void dfs(int p) {
		if (p >= n) {
			ans++;
			printf();
			return;
		}

		for (int i = p; i < n; i++) {
			swap(p, i);
			dfs(p + 1);
			swap(p, i);
		}
	}

	static void printf() {
		for (int i = 0; i < data.length; i++) {
			System.out.print(data[i] + " ");
		}
		System.out.println();
	}

	static void swap(int p, int i) {
		int t = data[p];
		data[p] = data[i];
		data[i] = t;
	}
}