public class FullArray {
int max = 8;
int[] arr = new int[max];
int count = 0;
public void sort(int n){
if (n == max){
for (int i = 0; i < arr.length; i++) {
System.out.printf("%d ",arr[i]+1);
}
System.out.printf("\n");
count++;
return;
}
for (int i = 0; i < max; i++) {
arr[n] = i;
if (isalready(n)){
continue;
}
sort(n+1);
}
}
private boolean isalready(int index){
for (int i = 0; i < index; i++) {
if (arr[i] == arr[index]){
return true;
}
}
return false;
}
}
public static void main(String[] args)
{
FullArray fullArray = new FullArray();
fullArray.sort(0);
System.out.println("一共有"+fullArray.count+"种排列!!");
}
java递归实现全排列
最新推荐文章于 2024-03-16 15:04:10 发布