java杨辉三角递归问题

[debugbird]

谁可以帮我看看这个程序怎么改啊！！非常谢谢啊！！

class Pascal
{
final int LIMIT = 10;
private int[][] a = new int[LIMIT][];

public Pascal(int a[][],int LIMIT)
{
for (int i = 0; i <= LIMIT; i++)
{
a[i] = new int[i+1];

for (int j = 0; j <= a[i].length - 1; j++)
{
if (j == 1 || j == a[i].length -1)
{
a[i][j] = 1;
}
else
{
a[i][j] = a[i-1][j] + a[i - 1][j - 1];
}
}
}
}
public String toString()
{
String result = "\t";
for (int i = 0; i < LIMIT + 1; i++)
{
for (int j = 0; j <a[i].length - 1; j++)
{
result += a[i][j] + "\t";
}
result += "\n";
}
return result;
}
}

public class PascalDemo
{
public static void main(String[] args)
{
Pascal pa = new Pascal();
System.out.println(pa);
}
}