Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
Note:
Could you optimize your algorithm to use only O(k) extra space?
public static List<Integer> getRow(int rowIndex) {
List<Integer> line = new ArrayList<Integer>();
for (int i = 0; i <= rowIndex; i++) {
line.add(1);
}
for (int i = 1; i < rowIndex; i++) {
for (int j = 1; j <= rowIndex - i; j++) {
int num = line.get(j) + line.get(j - 1);
line.set(j, num);
}
}
return line;
}