java基础：二维数组之杨辉三角

java基础：二维数组之杨辉三角

 

 

package com.atguigu.java;

public class YanHuiTest {
	public static void main(String[] args) {
		int [][] numbers = new int[10][];
		for (int i = 0; i < numbers.length; i++) {
			//numbers[i]:二维数组的索引位置
			//new int[i+1] 创建一维数组，长度为i+1			
			numbers[i] = new int[i+1];
			//给二维数组的元素（一维数组）的首个元素和最后一个元素赋值为1
			numbers[i][0] = numbers[i][i] = 1;
			
			for (int j = 1; j < numbers[i].length-1; j++) {
				numbers[i][j]=numbers[i-1][j]+numbers[i-1][j-1];
			}
			
		}
		
		
		for (int i = 0; i < numbers.length; i++) {
			for (int j = 0; j < numbers[i].length; j++) {			
				System.out.print(numbers[i][j]+" ");
			}	
			System.out.println();
		}
			
		
		
	}
}