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? public class S... 阅读全文
posted @ 2016-05-14 05:09 IncredibleThings 阅读(178) 评论(0) 推荐(0) 编辑