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?
最笨的
原创
2014-11-18 00:36:46 ·
472 阅读 ·
0 评论