使用java数组来实现杨辉三角,要求内存空间开辟越小越好
/**
* The Class YangHuiTriangle.
*/
public class YangHuiTriangle {
/**
* The main method.
*
* @param args
* the arguments
*/
public static void main(String[] args) {
new YangHuiTriangle().printYanghuiTriangle(10);
}
/**
* 生成指定行数的杨辉三角形
*
* @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 getNumLength(maxNum);
}
/**
* 阶乘计算
*
* @param start
* 阶乘计算的起始数字
* @param num
* 阶乘计算的终止数字
* @return 阶乘计算结果
*/
private long factorial(int start, int end) {
long result = start > 0 ? start : 1L;
while (end > start) {
result *= end--;
}
return result;
}
/**
* 根据指定数字计算数字的长度
*
* @param number
* 数字
* @return 数字的长度
*/
private int getNumLength(long number) {
int length = 0;
while (number > 0L) {
number /= 10L;
length++;
}
return length;
}
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 - getNumLength(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(" ");
}
}
}