杨辉三角（Pascal三角形）

递归算法

import java.util.Scanner;

public class TangHuiTriangle {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        result(scanner.nextInt());
    }

    public static void result(int row) {

        for (int i = 0; i < row; i++) {
            for (int j = 0; j <= i; j++) {
                System.out.print(getElement(i, j));
            }
            System.out.println();
        }
    }

    public static int getElement(int row, int col) {
        if (col == 0 || row == col)
            return 1;
        return getElement(row - 1, col - 1) + getElement(row - 1, col);
    }
}

非递归算法

import java.util.Scanner;

public class TangHuiTriangle {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        result(scanner.nextInt());
    }

    public static void result(int row) {

        int[][] array = new int[row][row];

        for (int i = 0; i < row; i++) {
            for (int j = 0; j <= i; j++) {
                if (j == 0 || i == j) {
                    array[i][j] = 1;
                    System.out.print(1);
                } else {
                    array[i][j] = array[i - 1][j - 1] + array[i - 1][j];
                    System.out.print(array[i][j]);
                }
            }
            System.out.println();
        }
    }
}