【Leetcode】Pascal's Triangle
来源:互联网 发布:淘宝店铺文案范文 编辑:程序博客网 时间:2024/06/01 09:36
题目:
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结束。
代码:
class Solution {public: vector<vector<int> > generate(int numRows) { vector<vector<int>> result; vector<int> CurrResult,LastResult; if(numRows==0)return result; CurrResult.push_back(1); result.push_back(CurrResult); for(int i=1;i<numRows;i++){ swap(CurrResult,LastResult); CurrResult.push_back(1); for(int j=1;j<i;j++){ CurrResult.push_back(LastResult[j-1]+LastResult[j]); } CurrResult.push_back(1); result.push_back(CurrResult); LastResult.clear(); } return result; }};
0 0
- 【Leetcode】Pascal's Triangle (Pascal)
- LeetCode Pascal's Triangle
- [Leetcode] Pascal's Triangle
- LeetCode: Pascal's Triangle
- [LeetCode] Pascal's Triangle
- 【leetcode】Pascal's Triangle
- LeetCode - Pascal's Triangle
- [LeetCode]Pascal's Triangle
- Leetcode: Pascal's Triangle
- Pascal's Triangle --Leetcode
- LeetCode-Pascal's Triangle
- [leetcode] Pascal's Triangle
- LeetCode - Pascal's Triangle
- 【leetcode】Pascal's Triangle
- LeetCode | Pascal's Triangle
- Pascal's Triangle -leetcode
- [leetcode]Pascal's Triangle
- Leetcode Pascal's Triangle
- Python之easy_install安装出错
- const
- And Then There Was One
- Intel 平台编程总结---自顶向下的软件优化策略
- LeetCode:Maximum Subarray
- 【Leetcode】Pascal's Triangle
- gzip
- 单调队列+DP
- hadoop常见错误及处理方法
- 悲催的实习面试经历
- 55个常用技巧
- 写出高性能SQL语句的35条方法分析
- 百度、高德、Googe经纬度转换
- c++: 构造函数(constructor)与各种眼花缭乱的初始化(initialization)