用二维数组打印杨辉三角形

public class EXR2 {
public static void main(String[] args) {
int[][] i = new int[10][];
for(int n = 0;n < i.length;n++) {
i[n] = new int[n+1];

	}
	for(int n = 0;n < i.length;n++) {
		for(int m = 0;m < i[n].length;m++) {
			i[n][0] = i[n][n] = 1;
			if(n > 1 && m > 0 && m < n) {
				i[n][m] = i[n-1][m] + i[n-1][m-1];
				
			}
		}
	}
	//编译二维数组
	for(int n = 0;n < i.length;n++) {
		for(int m = 0;m < i[n].length;m++) {
			System.out.print(i[n][m]+"\t");
		}
		System.out.println();
	}
}

}