public class TestRecursion {

static int a = 0;

public static void test01(){

a++;

System.out.println("test01:"+a);

if(a<=10){ //递归头

test01();

}else{ //递归体

System.out.println("over");

}

}

public static void test02(){

System.out.println("TestRecursion.test02()");

}

public static long factorial(int n){//利用递归算阶乘:5!=5*4*3*2*1

if(n==1){

return 1;

}else{

return n*factorial(n-1);

}

}

public static void main(String[] args) {

test01();

System.out.println(factorial(10));

}

}