杨辉三角
2013-02-21 19:06
267 查看
package com.accp;
//杨辉三角
public class Ex03 {
public static void main(String[] args) {
int[][]x = new int[10][10];
for(int i=0; i<x.length; i++){
for(int j=0; j<=i; j++){
if(j==0 || j==i){
x[i][j] = 1;
}
else{
x[i][j]=x[i-1][j]+x[i-1][j-1];
}
System.out.print(x[i][j]+"\t");
}
System.out.println();
}
}
}
package com.accp;
//杨辉三角改进版:
public class Ex04 {
public static void main(String[] args) {
int[][] x = new int[10][];
for (int i = 0; i < x.length; i++) {
x[i] = new int[i + 1];
for (int j = 0; j < x[i].length; j++) {
if (j == 0 || j == i) {
x[i][j] = 1;
} else {
x[i][j] = x[i - 1][j] + x[i - 1][j - 1];
}
System.out.print(x[i][j] + "\t");
}
System.out.println();
}
}
}
//杨辉三角
public class Ex03 {
public static void main(String[] args) {
int[][]x = new int[10][10];
for(int i=0; i<x.length; i++){
for(int j=0; j<=i; j++){
if(j==0 || j==i){
x[i][j] = 1;
}
else{
x[i][j]=x[i-1][j]+x[i-1][j-1];
}
System.out.print(x[i][j]+"\t");
}
System.out.println();
}
}
}
package com.accp;
//杨辉三角改进版:
public class Ex04 {
public static void main(String[] args) {
int[][] x = new int[10][];
for (int i = 0; i < x.length; i++) {
x[i] = new int[i + 1];
for (int j = 0; j < x[i].length; j++) {
if (j == 0 || j == i) {
x[i][j] = 1;
} else {
x[i][j] = x[i - 1][j] + x[i - 1][j - 1];
}
System.out.print(x[i][j] + "\t");
}
System.out.println();
}
}
}