LeetCode: Pascals Triangle II

LeetCode: Pascals Triangle II

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

/**
* Description
*
* @author hzhou
*/
public class PascalTriangleTwo {
public List<Integer> getRow(int rowIndex) {
if (rowIndex < 0) {
return new ArrayList<Integer>();
}
List<List<Integer>> list = new ArrayList<List<Integer>>();
for (int i = 0; i <= rowIndex; i++) {
list.add(helper(i, list));
}
return list.get(rowIndex);
}
private List<Integer> helper(int num, List<List<Integer>> list) {
List<Integer> result = new ArrayList<Integer>();
result.add(1);
if (num > 0) {
List<Integer> tmp = list.get(num - 1);
for (int i = 0; i < tmp.size() - 1; i++) {
result.add(tmp.get(i) + tmp.get(i + 1));
}
result.add(1);
}
return result;
}
}