回溯法
public static void main(String[] args) {
int[] arr= {1,2,3,4};
quanpailie(arr,0);
}
public static void quanpailie(int[] arr,int n) {
int length=arr.length;
if(n>=length) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
System.out.println();
}else {
for (int i = n; i < arr.length; i++) {
int temp=arr[n];
arr[n]=arr[i];
arr[i]=temp;
quanpailie(arr,n+1);
temp=arr[n];
arr[n]=arr[i];
arr[i]=temp;
}
}
}