Pascal's Triangle

public class Solution {
public ArrayList<ArrayList<Integer>> generate(int k) {
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
for (int i = 0; i < k; i++)
{
ArrayList<Integer> tmpResult = new ArrayList<Integer>();
if (i == 0)
{
int addNumber = 1;
tmpResult.add(addNumber);
//System.out.print(1 + " ");
}
else
{
tmpResult.add(1);
//System.out.print(1 + " ");
for (int j = 0; j < i - 1; j++)
{
ArrayList<Integer> addResult = result.get(i - 1);
int addNumber = addResult.get(j) + addResult.get(j + 1);
tmpResult.add(addNumber);
//System.out.print(addNumber + " ");
}
tmpResult.add(1);
//System.out.print(1);
}
result.add(tmpResult);
//System.out.println();
}
return result;
}
}