Given an index k, return the k-th row of the Pascal's triangle.
k
For example, given k = 3,
k = 3
Return [1,3,3,1].
[1,3,3,1]
Note: Could you optimize your algorithm to use only O(k) extra space?
O(k)
滚动数组。