[leetcode] Pascal's Triangle II

发布时间:2017-2-22 12:05:53 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"[leetcode] Pascal's Triangle II",主要涉及到[leetcode] Pascal's Triangle II方面的内容,对于[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? class Solution { public: vector<int> getRow(int rowIndex) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> cur; cur.push_back(1); for(int i=1 ; i<=rowIndex ; i++){ vector<int> temp; temp.push_back(1); for(int j=1 ; j<i ; j++) temp.push_back(cur[j-1]+cur[j]); temp.push_back(1); cur=temp; } return cur; } };

上一篇:Ubuntu12.10以上版本安装Sublime Text 2并破解,免注册码
下一篇:request_mem_region 和 ioremap的理解