Pascal's Triangle II
来源:互联网 发布:淘宝客佣金怎么算的 编辑:程序博客网 时间:2024/05/16 10:23
Given an index k, return the kth row of the Pascal’s triangle.
For example, given k = 3,
Return [1,3,3,1].
杨辉三角是从第0行开始算起的,主要思路首相利用Pascal’s Triangle生成杨辉三角,
http://blog.csdn.net/niekai01/article/details/52289999
然后输出最后一行即求解此题。
#include<iostream>#include<vector>using namespace std;vector<vector<int> > generate(int numRows) { vector<vector<int> > ret; if(numRows==0) return ret; vector<int> last(1,1); ret.push_back(last); for(int i=2;i<=numRows;i++) { last.push_back(0); vector<int> cur=last; for(int j=1;j<i;j++) { cur[j]=last[j-1]+last[j]; } ret.push_back(cur); last=cur; } return ret;} vector<int> getRow(int rowIndex) { vector<vector<int> > res; vector<int> result; res=generate(*rowIndex+1*); result=res[res.size()-1]; return result;}int main(){ int k; k=3; vector<int> res1; //vector<int> last(1,1); res1= getRow(k); for(int i=0;i<res1.size();i++) cout<<res1[i]<<endl; /* for(int i=0;i<res.size();i++) { for(int j=0;j<res[i].size();j++) { cout<< res[i][j] <<endl; } } */ return 0;}
0 0
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle & Pascal's Triangle II
- Pascal's Triangle && Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- 父子进程间分发FD
- RasEnumEntries
- Class对象和Java反射机制
- 关于C语言指针数组的几个实例
- php面向对象魔术方法
- Pascal's Triangle II
- win7下Android studio添加genymotion后,运行模拟器时,Virtualbox出错(提示VBoxDD.DLL错误)的解决方案
- 第4章第1节练习题11 查找最近公共祖先节点
- C#基础知识(二)== 与equal比较
- 爬虫
- sql 高级查询语句总结
- hadoop在执行时出现 Caused by: java.lang.OutOfMemoryError: Java heap space
- 谈谈使用破解百度云app的安全风险
- html之js笔记二