（JAVA题编程）金子塔状的YANG辉三角怎么编程（不要靠左边的那种）

Question

5行以内是行了，6行以后不对称了啊，修改下啊

Answer 1

public class Yanghui {

public static void main(String[] args) {
Yanghui yang = new Yanghui();
yang.printYanghuiTriangle(13);
}

/**
* 生成指定行数的杨辉三角形
*
* @param lines 杨辉三角形的行数
*/
public void printYanghuiTriangle(int lines) {
if(lines < 1) {
throw new IllegalArgumentException("lines must be great than 0.");
}
if(lines > 30) {
throw new IllegalArgumentException("lines is too big.");
}
int[] line = new int[lines];
int maxLen = getMaxLen(lines);
for(int i = 0; i < lines; i++) {
line[0] = line[i] = 1;
for(int j = 1, k = i / 2, pre = line[0]; j <= k; j++) {
int cur = line[j];
line[i - j] = line[j] += pre;
pre = cur;
}
printLine(line, i + 1, maxLen);
}
}

/**
* 根据指定行数的杨辉三角形，计算其中最大数字的长度
* @param lines 杨辉三角形的行数
* @return 最大数字的长度
*/
private int getMaxLen(int lines) {
int k = lines / 2;
long maxNum = factorial(k + 1, lines - 1) / factorial(1, lines - 1 - k);
return getLength(maxNum);
}

/**
* 阶乘计算
* @param start 阶乘计算的起始数字
* @param num 阶乘计算的终止数字
* @return 阶乘计算结果
*/
private long factorial(int start, int num) {
long result = start > 0 ? start : 1L;
while(num > start) {
result *= num--;
}
return result;
}

/**
* 根据指定数字计算数字的长度
* @param num 数字
* @return 数字的长度
*/
private int getLength(long num) {
int len = 0;
while(num > 0L) {
num /= 10L;
len++;
}
return len;
}

private void printLine(int[] yanghui, int line, int width) {
printSpaces((yanghui.length - line) * width);

for(int i = 0; i < line; i++) {
if(i > 0) {
printSpaces(width);
}
printSpaces(width - getLength(yanghui[i]));
System.out.print(yanghui[i]);
}
System.out.println();
if(width > 1) {
System.out.println();
}
}

private void printSpaces(int spaceCount) {
for(int i = 0; i < spaceCount; i++) {
System.out.print(" ");
}
}
}

Answer 2

public class 杨辉三角 {
public static void main (String args[])
{
final int maxline=10;
int yanghui [][]=new int [maxline][];
for(int i=0;i<yanghui.length;i++)
yanghui[i]=new int [i+1];
yanghui[0][0]=1;

for(int i=1;i<yanghui.length;i++)
{
yanghui[i][0]=1;
yanghui[i][yanghui[i].length-1]=1;
for(int j=1;j<yanghui[i-1].length;j++)
{yanghui[i][j]=yanghui[i-1][j-1]+yanghui[i-1][j];}

}
for(int i=0;i<yanghui.length;i++)
{ for(int k=yanghui.length-i;k>0;k--)
System.out.print(" ");
for(int j=0;j<yanghui[i].length;j++)
System.out.print(yanghui[i][j]+" ");
System.out.println();
}
}

}本回答被提问者采纳

Answer 3

怎么又删掉我的回答？？？
YangHui.java

public class YangHui
{
public static void main(String args[])
{
int i,j,space,n;
n=20;//为了省事，没有从命令行参数取值。
int a[][]=new int[n][];
a[0]=new int[1];
for(i=1;i<n;i++) a[i]=new int[i+1];
a[0][0]=1;
for(i=1;i<n;i++)
{
a[i][0]=1;//行首1
a[i][a[i].length-1]=1;//行尾1
for(j=1;j<a[i].length-1;j++) //肩上两数之和
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
for(i=0;i<n;i++)
{
for(space=n-i;space>0;space=space-1)
{
System.out.print("\t");
}
for(j=0;j<a[i].length;j++)
{
System.out.print(a[i][j]+"\t\t");
}
System.out.println();
}
}
}