java 中的杨辉三角_Java中杨辉三角的一种方法

完整代码如下所示；

package cn.hellowyou.fancy;

import java.util.Scanner;

public class YangHui

{

public static void main(String[] args)

{

System.out.println("Please input the num of lines:");

Scanner scanner = new Scanner(System.in);

int NumLines = scanner.nextInt();

int[][] ary = new int[NumLines][NumLines];

//初始化边上的两行列

for(int i = 0; i < NumLines; i++)

{

for(int j = 0; j < NumLines;j++)

{

if(j == 0)

{

ary[i][0] = 1;

}

else if(j == i)

{

ary[i][j] = 1;

}

else

{

ary[i][j] = 0;

}

}

}

for(int i = 2; i < NumLines; i++)

{

for(int j = 1; j < i; j++)

{

ary[i][j] = ary[i - 1][j - 1] + ary[i - 1][j];//值为左上方元素和正上发元素之和。

}

}

for(int i = 0; i < NumLines; i++)

{

for(int j = 0; j <= i; j++)

{

System.out.print(ary[i][j] + " ");

}

System.out.println();

}

}

}