杨辉三角——java输出（二维数组）

package LocalSend;

public class YHTriangle {

	public static void main(String[] args) {
		// TODO Auto-generated method stub\
		int deep = 10;
		int[][] a = new int[deep][]; // 不规则定义二维数组
		for (int i = 0; i < deep; i++) { // 给每一行定义列的数量
			a[i] = new int[i + 1];
		}
		for (int i = 0; i < deep; i++) { //每一行都设置好开始和结尾的1
			a[i][0] = 1;
			a[i][a[i].length - 1] = 1;
		}
		for (int i = 2; i < deep; i++) {  //设置中央的值
			for (int j = 1; j < i; j++) {
				a[i][j] = a[i - 1][j] + a[i - 1][j - 1];
			}
		}

		for (int i = 0; i < deep; i++) { //打印
			for (int j = 0; j < a[i].length; j++) {
				System.out.print(a[i][j] + " ");
			}
			System.out.println("");
		}

	}

转载自：点击打开链接

结果输出：