[leetcode] Pascal's Triangle II

发布时间:2014-10-22 12:04:34
来源:分享查询网

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; } };

返回顶部
查看电脑版