leetcode118. Pascal's Triangle
来源:互联网 发布:ubuntu 开启ssh服务 编辑:程序博客网 时间:2024/05/01 19:19
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]其实是求杨辉三角的算法,可以看出每一行的数据是上一行的之和。
代码如下:
class Solution {public: 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> tmp=last; for(int j=1;j<i;j++) { tmp[j]=last[j-1]+last[j]; } ret.push_back(tmp); last=tmp; } return ret; }};
0 0
- LeetCode118 Pascal's Triangle
- LeetCode118:Pascal's Triangle
- leetcode118. Pascal's Triangle
- leetcode118~Pascal's Triangle
- LeetCode118 Pascal's Triangle
- leetcode118 Pascal's Triangle
- LeetCode118. Pascal's Triangle
- LeetCode118—Pascal's Triangle
- LeetCode118——Pascal's Triangle
- leetcode118 and 119 Pascal's Triangle
- leetcode118 & 119. [Array]Pascal's Triangle
- Leetcode118. Pascal's Triangle (杨辉三角)
- 杨辉三角(Pascal's Triangle)- LeetCode118-119
- 二维数组的生成-【leetcode118- Pascal's Triangle 】
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle Pascal's Triangle||
- Pascal's Triangle & Pascal's Triangle II
- 剖析NodeJs的事件轮询机制
- Collect View
- StringUtils中 isNotEmpty 和isNotBlank的区别
- 向量vector
- HDU4012 Paint on a Wall(BFS)
- leetcode118. Pascal's Triangle
- Android官方开发文档Training系列课程中文版:使用Fragment构建动态UI之与其它Fragment通信
- 最新Android Studio开发NDK步骤(自动版)
- c++实验2—标准体重
- mybatis的增删查改
- 指纹拼接
- Xcode安装XAlign
- Eclipse配置默认新建文件类型
- 九月十月百度,迅雷,华为,阿里巴巴笔试面试六十题(第411~470题)