来源:JK老班
//全排列(有顺序)
import java.util.Scanner;public class Permutation {
int n;
boolean[] Mark;
int[] A;
public Permutation() {
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
Mark=new boolean[n+1];
A=new int[n];
Search(0);
}
void Search(int pos) {
if(pos==n){
System.out.print(A[0]);
for(int i=1;i<n;i++) System.out.print(" "+A[i]);
System.out.println();
return;
}
for(int i=1;i<=n;i++)
if(Mark[i]==false) {
A[pos]=i; Mark[i]=true;
Search(pos+1);
Mark[i]=false;
}
}
public static void main(String[] args) {
Permutation p=new Permutation();
}}