Java输出杨辉三角

package lanqiao;

public class YangHui {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int[][] yanghui = new int[5][];		//5表示行数，可以修改
		for(int i = 0 ; i < yanghui.length ; i++) {
			//为一维数组创建空间
			yanghui[i] = new int[i + 1];
			for(int j = 0 ; j <= yanghui[i].length - 1 ; 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];
				}
			}
		}
		//输出杨辉三角
		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();
		}

	}

}

运行结果如下：