打印杨辉三角

来源:互联网 发布:java递归树形数据结构 编辑:程序博客网 时间:2024/06/02 05:42
package swordOffer;import java.util.Arrays;/** * 打印n行的杨辉三角 * @author Administrator * */public class YangHuiTriangle {    public void printTriangle(int n) {        long[][] array = new long[n][n];        for (int i = 0; i < array.length; i++) {            array[i] = new long[i + 1];            //1 计算数组(重点在于边界)            for (int j = 0; j <= i; j++) {                if (i == 0 || j == 0 || i == j) {                    array[i][j] = 1;                } else {                    array[i][j] = array[i-1][j-1] + array[i-1][j];                }            }            //2 打印空格            for (int k = n; k > i; k--) {                System.out.print(" ");            }        System.out.println(Arrays.toString(array[i]));        }    }    public static void main(String[] args) {        YangHuiTriangle yangHuiTriangle = new YangHuiTriangle();        int number = 10;        yangHuiTriangle.printTriangle(number);    }}
原创粉丝点击