【64.22】【E】【leetcode】Pascal's Triangle II
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?
Subscr
原创
2015-11-28 16:16:02 ·
483 阅读 ·
0 评论