全排列（DFS）

全排列

给定一个没有重复数字的序列，返回其所有可能的全排列。

使用used数组标记

public class Main {
	static int index = 0;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		ArrayList<Integer> list = new ArrayList<>();
		ArrayList<ArrayList<Integer>> List = new ArrayList<ArrayList<Integer>>();
		int num = in.nextInt();
		int nums[] = new int[num];
		for (int i = 0; i < num; i++) {
			nums[i] = in.nextInt();
		}
		boolean used[] = new boolean[num];
		dfs(nums, used, list, List);
	}

	public static void dfs(int nums[], boolean used[], ArrayList<Integer> list, ArrayList<ArrayList<Integer>> List) {
		if (list.size() == nums.length) {
			List.add(new ArrayList<>(list));
			System.out.println(List.get(index));
			index++;
		}
		for (int i = 0; i < nums.length; i++) {
			if (!used[i]) {
				used[i] = true;
				list.add(nums[i]);
				dfs(nums, used, list, List);
				used[i] = false;
				list.remove(list.size() - 1);
			}
		}
	}
}

直接使用contains判断元素是否被使用过

import java.util.ArrayList;

public class Main {
	static int i = 0;

	public static void main(String[] args) {
		int num[] = { 1, 2, 3 };
		ArrayList<Integer> list = new ArrayList<>();
		ArrayList<ArrayList<Integer>> List = new ArrayList<ArrayList<Integer>>();
		dfs(num, list, List);
	}

	public static void dfs(int num[], ArrayList<Integer> list, ArrayList<ArrayList<Integer>> List) {
		if (list.size() == num.length) {
			List.add(list);
			System.out.println(List.get(i));
			i++;
		}
		for (int i = 0; i < num.length; i++) {
			if (!list.contains(num[i])) {
				list.add(num[i]);
				dfs(num, list, List);
				list.remove(list.size() - 1);
			}
		}
	}
}