全排列实现代码
public class Arrange {
public static void main(String[] args) {
int[] v = {7, 5, 3};
int n = v.length;
perm(v, 0, n - 1);
System.out.println(count);
}
static void perm (int[] v, int left, int right) {
if (left == right) {
for (int i: v) {
System.out.print(i + " ");
}
System.out.println();
} else {
for (int i = left; i <= right; i++) {
swap(v, left, i);
perm(v, left + 1, right);
swap(v, left, i);
}
}
}
static void swap(int[] v, int left, int i) {
int temp = v[left];
v[left] = v[i];
v[i] = temp;
}
}
也是使用了老师提供的部分伪代码实现
纯属记录分享,会有更好的算法