【思想】遞歸
public class Test
{
static int[] a = new int[10];
public static void main(String[] args)
{
for(int i = 0;i < 10;i++)
{
a[i] = i;
}
f(0);
}
public static void f(int k)
{
//if這裏是遞歸的中止條件,如果是全排的話,終止條件爲k==a.length或k==a.length-1
//如果是從m個數字中任取n個數字全排的話,終止條件爲k==n
if(k == a.length)
{
for(int i = 0;i<a.length;i++)//此處用於放置執行全排後要執行的具體判斷或操作
{
System.out.print(a[i]);
}
System.out.println();
}
for(int i = k;i < a.length;i++)
{
int x = a[k];a[k] = a[i];a[i] = x;
f(k+1);
x = a[k];a[k] = a[i];a[i] = x;
}
}
}