java实现1~n 的全排列

public class Algorithm1 {

	/**
	 * 1-n 全排列算法
	 */
	static int[] marks = new int[10];//标记某个数是否被用过,可以自己调整大小
	static int[] nums = new int[10];
	static int n;


	public static void main(String[] args) {
		n = 3;
		d(1);//第几步
	}

	public static void d(int step) {

		if (step == n + 1) {
			System.out.println();
			for (int i = 1; i <= n; i++) {
				System.out.print(nums[i] + " ");
			}
			return;

		}


		for (int i = 1; i <= n; i++) {
			if (marks[i] == 0) {
				nums[step] = i;
				marks[i] = 1;

				d(step + 1);
				marks[i] = 0;
			}
		}


	}


}