首页 > 代码库 > Pascal's Triangle II
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) { vector<int> a,b,c; a.push_back(1); b.push_back(1); b.push_back(1); if(rowIndex == 0) return a; if(rowIndex == 1) return b; for(int i = 2; i<=rowIndex; i++){ a.clear(); a.push_back(1); for(int j = 1; j < i; j++){ a.push_back(b[j-1]+b[j]); } a.push_back(1); c = a; a = b; b = c; } return b; }};
Pascal's Triangle II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。