【Java】递归法求杨辉三角第m层第n个元素的值

public class a {
    
    
    //杨辉三角m层的第n个元素
    public static int f(int m,int n){
    
    
        if(n==0) return 1;
        if(m==n) return 1;
        return f(m-1,n)+f(m-1,n-1);
    }
    /*
    
    public static void main(String[] args){
        System.out.print(f(5,0));
    }

     */
    public static void main(String[] args){
    
    
        int level = 6;
        for(int i=0;i<=level;i++){
    
    
            System.out.print(f(level,i)+" ");
        }
        System.out.println();
    }
}