Fork me on GitHub
2017年4月5日
[leetcode-119-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 阅读全文
posted @ 2017-04-05 17:36 hellowOOOrld 阅读(118) 评论(0) 推荐(0)