首页 > 代码库 > 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?
用递归的方法实现,C++代码如下:
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<int> getRow(int rowIndex) { if(rowIndex==0) return {1}; vector<int> vec1(rowIndex); vector<int> vec2(rowIndex+1); vec1=getRow(rowIndex-1); vec2[0]=1; for(int i=1;i<rowIndex;i++) { vec2[i]=vec1[i-1]+vec1[i]; } vec2[rowIndex]=1; return vec2; }};int main(){ Solution s; int n; cout<<"input n is :"; cin>>n; vector<int> vec=s.getRow(n); for(auto v:vec) cout<<v<<" "; cout<<endl;}
运行结果如下:
Pascal's Triangle II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。