java语言实现的杨辉三角 package com.exer; /* * 杨辉三角 */ public class yangHui { public static void main(String[] args) { //声明二维数组:10行 int[][] yangHui = new int [10][]; //先将列层数组在栈中new出对象,然后才能使用 //给每一行开头和结尾赋值 for(int i = 0;i < yangHui.length;i++){ yangHui[i] =new int[i+1]; yangHui[i][0] = yangHui[i][i] = 1; } //每一维开头和结尾数值为1,其它的为垂直上方元素与垂直上方元素左边元素之和 for(int i = 2;i < yangHui.length;i++){ for(int j = 1;j < yangHui[i].length - 1;j++){ //给每一行中间元素赋值 yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j]; } } //打印每一行元素 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(); } } }