使用二维数组打印一个10行杨辉三角
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1)第一行有1个元素,第n行有n个元素
2)每一行的第一个元素和最后一个元素都是1
3)从第三行开始,对于非第一个元素和最后一个元素的元素值:
a[ i ][ j ] = a[ i - 1 ][ j ] + a[ i - 1 ][ j - 1 ]
public class test{public static void main(String[] args){int yanghui[][] = new int[10][];for(int i = 0; i < yanghui.length; i++){//给每个一维数组(行)开辟空间yanghui[i] = new int[i + 1];//给每个一维数组(行)赋值for(int j = 0; j < yanghui[i].length; j++){if(j == 0 || j == yanghui[i].length - 1){ //首尾元素yanghui[i][j] = 1;}else{ //中间元素yanghui[i][j] = yanghui[i - 1][j] + yanghui[i - 1][j - 1];}}}System.out.println("杨辉三角:");for(int i = 0;i < yanghui.length; i++){for (int j = 0; j < yanghui[i].length; j++ ) {System.out.print(yanghui[i][j] + "\t");}System.out.println();}}
}