杨辉三角
2016-04-30 18:33
204 查看
package yizhi;
//杨辉三角
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];
}
//显示的给数组赋值
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 && 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] + "\t");
}
System.out.println();
}
}
}
//杨辉三角
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];
}
//显示的给数组赋值
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 && 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] + "\t");
}
System.out.println();
}
}
}