如何改成方法的递归，求解决

public class YHSJ_1 {

public static void main(String[] args) {
    int rows = 10;

    for (int i = 0; i < rows; i++) {
        int number = 1;
        // 打印空格字符串
        System.out.format("%" + (rows - i) * 2 + "s", "");
        for (int j = 0; j <= i; j++) {
            System.out.format("%4d", number);
            number = number * (i - j) / (j + 1);
        }
        System.out.println();
    }
}

}

public static void main(String[] args) {
    int rows = 10;
    for (int i = 0; i < rows; i++) {
        int number = 1;
        // 打印空格字符串
        System.out.format("%" + (rows - i) * 2 + "s", "");
        for (int j = 0; j <= i; j++) {
            System.out.format("%4d", triangle(i,j));
        }
        System.out.println();
        
    }
        
    }
    public static int triangle(int i,int j)
{
    if(j == 0 || i == j)
        return 1;
    return (triangle(i-1,j-1)+triangle(i-1,j));
}