Pascal's Triangle

Pascal's Triangle

[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]

public class Solution {
public List<Integer> getRow(int rowIndex) {
List list = new ArrayList<Integer>();
if(0 == rowIndex)
{
list.add(1);
return list;
}

if(1 == rowIndex)
{
list.add(1);
list.add(1);
return list;
}
List list_tmp = getRow(rowIndex-1);
list.add(1);
Iterator ite =list_tmp.iterator();
int tmp =0;
int tmp_2=0;
tmp = (Integer)ite.next();
while(ite.hasNext())
{
tmp_2 = (Integer)ite.next();
list.add(tmp+tmp_2);
tmp = tmp_2;
}
list.add(1);
return list;
}
public List<List<Integer>> generate(int numRows) {
List list = new ArrayList<List>();
for(int i=0;i<numRows;i++)
{
list.add(getRow(i));
}
return list;
}
}

上述代码是根据Pascal's Triangle II 修改的，代码上有可以剪枝的地方