java 杨辉三角

最新推荐文章于 2024-08-07 09:14:10 发布

biubiuDemo

最新推荐文章于 2024-08-07 09:14:10 发布

阅读量82

点赞数

文章标签： java 算法

本文链接：https://blog.csdn.net/crush1129/article/details/128953526

版权

public class YangHui {
	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];
		    yanghui[i][0] = yanghui[i][i] = 1;
		    
		    for(int j = 1;j < i;j++){
		        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();
		}
	}
}