package xcrj.kchalgorithm.bruteForce;
import java.util.*;
public class FullPermutation {
public static void fullPermutation(int n) {
// 排列有顺序,所以使用List
Set> result = new HashSet<>(6);
Set> result2 = new HashSet<>(6);
List ls = new ArrayList<>(3);
ls.add(1);
result.add(ls);
for (int i = 2; i <= n; i++) {
// !i=2时,在0和1索引处插入i;i=3时,在0,1,2索引处插入i
for (List list : result) {
List list2 = null;
for (int j = 0; j < i; j++) {
// 每插入一次构造1个list2
list2 = new ArrayList<>(1);
// 将list深拷贝到list2
for (Integer v : list) {
list2.add(v);
}
// 在index j处添加i元素
list2.add(j, i);
result2.add(list2);
}
}
// 拷贝回result
result.clear();
for (List list2 : result2) {
List list = new ArrayList<>(1);
for (Integer v : list2) {
list.add(v);
}
result.add(list);
}
result2.clear();
}
System.out.println("1~" + n + "的全排列:");
System.out.println(result);
}
public static void main(String[] args) {
fullPermutation(3);
}
}