Pascal's Triangle
来源:互联网 发布:杭州达内java 编辑:程序博客网 时间:2024/05/29 09:07
一、问题描述
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]]
二、思路
从杨辉三角中找到规律:第一列都是1,最后一列也是1,从第三行开始,除过1的每个元素都是上面的元素加上上面元素的左边元素相加得到,我们找到递归式:
vec[i][j] = vec[i - 1][j - 1] + vec[i - 1][j];
三、代码
class Solution {public: vector<vector<int>> generate(int numRows) { vector<vector<int>> vec; for(auto i = 0; i < numRows;++i){ vec.push_back(vector<int>(i + 1,1)); for(auto j = 1; j < i; ++j) vec[i][j] = vec[i - 1][j - 1] + vec[i - 1][j]; } return vec; }};
0 0
- 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
- Pascal's Triangle && Pascal's Triangle II
- 【Leetcode】Pascal's Triangle (Pascal)
- LeetCode Pascal's Triangle
- [Leetcode] Pascal's Triangle
- LeetCode: Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- [LeetCode] Pascal's Triangle
- 【leetcode】Pascal's Triangle
- [118]Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- LeetCode - Pascal's Triangle
- Pascal's Triangle
- ST-LINK printf 使用
- 请假!最近手头有点其他事情,笔记暂停更新一周。
- 1048. Find Coins (25)
- c#实现二叉树+二叉树遍历彻底理解
- J2ee项目从0搭建进阶(一):springmvc 集成 tiles3实现页面模板
- Pascal's Triangle
- Eclipse 关于修改Servlet 的问题
- Matlab 把图像标度在全尺度gscale()
- 常见易错笔试题 —— java
- Navicat for Linux破解方式
- 数据结构---树
- Tomcat的启动,停止及重启(windows系统)
- [PAT] B1010
- Scala11