/**
* 杨辉三角
*
*/
public class YHuiTest {
public static void main(String[] args) {
final int row =6;
int yh[][] = new int[row][row];
for (int i = 0; i < row; i++) {
yh[i][0]=1;
yh[i][i]=1;
}
for (int i = 2; i < row; i++) {
for (int j = 1; j < row; j++) {
yh[i][j]=yh[i-1][j-1]+yh[i-1][j];
}
}
for (int i = 0; i < row; i++) {
for (int j = 0; j <=i; j++) {
System.out.print(yh[i][j]+" ");
}
System.out.println();
}
}
}
输出结果如下:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1