public static void main(String[] args) {
int[] array = { 1, 2, 3, 4, 5 };
// 阶乘算法
Function<Integer, Integer> fact = x -> {
BiFunction<BiFunction, Integer, Integer> factHelper = (f, i) -> (i == 0) ? 1 : i
* (Integer) f.apply(f, i - 1);
return factHelper.apply(factHelper, x);
};
for (int i = 1; i <= fact.apply(array.length); i++) {
System.out.println(Arrays.toString(arrange(array, i)));
}
}
// 返回数组array的第n条排列结果
private static int[] arrange(int[] array, int n) {
int[] arg = new int[array.length - 1];
int index = 0;
// 根据数组长度动态生成算法参数
for (int i = 0; i < arg.length; i++) {
arg[i] = i;
}
// 递归计算第n行的算法参数
while (n > 1) {
int num = arg.length - 1;
int max = arg.length;
arg[num] = arg[num] + 1;
while (arg[num] > max && num != 0) {
arg[num] = num;
arg[num - 1]++;
num--;
}
n--;
}
// 排列算法
while (index < array.length - 1) {
array = swap(array, index, arg[index]);
index++;
}
return array;
}
// 将数组中2个元素位置互换
private static int[] swap(int[] array, int i, int j) {
int[] tmp = Arrays.copyOf(array, array.length);
tmp[i] = array[j];
tmp[j] = array[i];
return tmp;
}
int[] array = { 1, 2, 3, 4, 5 };
// 阶乘算法
Function<Integer, Integer> fact = x -> {
BiFunction<BiFunction, Integer, Integer> factHelper = (f, i) -> (i == 0) ? 1 : i
* (Integer) f.apply(f, i - 1);
return factHelper.apply(factHelper, x);
};
for (int i = 1; i <= fact.apply(array.length); i++) {
System.out.println(Arrays.toString(arrange(array, i)));
}
}
// 返回数组array的第n条排列结果
private static int[] arrange(int[] array, int n) {
int[] arg = new int[array.length - 1];
int index = 0;
// 根据数组长度动态生成算法参数
for (int i = 0; i < arg.length; i++) {
arg[i] = i;
}
// 递归计算第n行的算法参数
while (n > 1) {
int num = arg.length - 1;
int max = arg.length;
arg[num] = arg[num] + 1;
while (arg[num] > max && num != 0) {
arg[num] = num;
arg[num - 1]++;
num--;
}
n--;
}
// 排列算法
while (index < array.length - 1) {
array = swap(array, index, arg[index]);
index++;
}
return array;
}
// 将数组中2个元素位置互换
private static int[] swap(int[] array, int i, int j) {
int[] tmp = Arrays.copyOf(array, array.length);
tmp[i] = array[j];
tmp[j] = array[i];
return tmp;
}