杨辉三角

public class YangHui {
	public static void main (String[] args){
		
		int[][] YangHui = new int[13][];
		
		// 初始化
		for(int i = 0; i < YangHui.length; i++){
			YangHui[i] = new int[i + 1];
		}
		
		// 给二维数组每个元素赋值
		for(int i = 0; i < YangHui.length; i++){
			for(int j = 0; j < YangHui[i].length; j++){
				YangHui[i][0] = YangHui[i][i] = 1;
				
				if(i > 1 && j > 0 && j < i){
					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] + "\t");
			}
			System.out.println();
		}
	}
}