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 class Solution {
public ArrayList<Integer> getRow(int rowIndex) {
ArrayList<Integer> list = new ArrayList<Integer>();
// init the first row
list.add(1);
if (rowIndex == 0) return list;
for (int i = 1; i <= rowIndex; i++) {
for (int j = i-1; j > 0; j--) list.set(j, list.get(j) + list.get(j-1));
list.add(1)
}
return list;
}
}