**
杨辉三角
**
package com.hy.exer;
/**
*
- @Description 杨辉三角
- @author lph Email:liupenghao1201@163.com
- @version
- @date 2022年5月17日上午9:17:25
*/
public class ArrExet1 {
public static void main(String[] args) {
//1.创建二维数组
int[][] yanghui = new int[10][];
//2.给数组的元素赋值
for(int i = 0; i < yanghui.length; i++) {
yanghui[i]= new int [i + 1];
//给首末元素赋值
yanghui[i][0] = yanghui[i][i] = 1;
//给非首末元素赋值
for(int j = 1 ; j< yanghui[i].length - 1;j++) {
yanghui[i][j] = yanghui[i-1][j-1] + yanghui[i-1][j];
}
}
//3.遍历数组
for(int i = 0; i < yanghui.length; i++) {
for(int j = 0; j < yanghui[i].length; j++) {
System.out.print(yanghui[i][j] + " ");
}
System.out.println();
}
}
}