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 List<Integer> getRow(int rowIndex) {
List<Integer> list = new ArrayList<Integer>();
List<List<Integer>> resultList = new ArrayList<List<Integer>>();