打印出杨辉三角的三种方法

来源:互联网 发布:华夏网络工具包 编辑:程序博客网 时间:2024/05/08 10:40

方法一:

public class Demo026 {

public static void main(String[] args) throws Exception {
BufferedReader stdin = new BufferedReader(new InputStreamReader(
System.in));
System.out.print("请输入需要打印的行数:");
int n = new Integer(stdin.readLine());
Vector<Integer> vector1 = new Vector<Integer>();
;
for (int i = 1; i <= n; i++) {
Vector<Integer> vector = new Vector<Integer>();
for (int j = 1; j <= n - i; j++) {
System.out.print(" ");// 打印前面的空白
}
vector.addElement(1);
if (i >= 3) {
for (int k = 2; k <= i - 1; k++) {
int m = vector1.elementAt(k - 2) + 


vector1.elementAt(k - 1);
vector.addElement(m);
}
}
if (i >= 2)
vector.addElement(1);
vector1 = vector;
for (int h = 0; h < vector.size(); h++) {
System.out.print(vector.elementAt(h) + " ");
}
System.out.println("");
}
}


}
方法二:
public class Demo009 {
public static void main(String[] args) {
int[][] strs = new int[10][10];
//给数组的所有单元都赋值为1
for (int i = 0; i < 10; i++) {
for (int j = 0; j <= i; j++) {
strs[i][j] = 1;
}
}
//从第2行、第1列开始,对应位置的数据是其肩上两个数据的和
for(int i=2; i<10; i++){
for(int j=1; j<=i; j++){
strs[i][j] = strs[i-1][j-1] +strs[i-1][j];
}
}
//将数组打印出来
for (int i = 0; i < 10; i++) {
for (int j = 0; j <= i; j++) {
System.out.print(strs[i][j]+"\t");
}
System.out.println();
}
}
}

方法三(递归):
public class Demo008 {
public static int c(int n,int k){
if(n==k || k==0){
return 1;
}else{
return(c(n-1,k)+c(n-1,k-1));
}
}
public static void main(String[] args) {
for(int i=0; i<=10; i++){
for(int j=0; j<=i; j++){
System.out.print(c(i,j)+"\t");
}
System.out.println();
}
}
}
原创粉丝点击