递归求n!

public class Recursive02 {
    public static void main(String[] args) {
        int i = funtionA(4);
        System.out.println(i);
    }
    public static int funtionA(int n){
        if (n==0){
            return 1;
        } else{
            return funtionA(n-1)*n;
        }
    }
}