Pascal's Triangle
来源:互联网 发布:淘宝退货运费险 编辑:程序博客网 时间:2024/06/16 02:50
-----QUESTION-----
Given
For example, given
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]
-----SOLUTION-----
class Solution {public: vector<vector<int> > generate(int numRows) { vector<vector<int>> result(numRows, vector<int>()); if(numRows == 0) return result; result[0].push_back(1); for(int i =1; i < numRows; i++) { result[i].push_back(1); for(int j = 1; j<i;j++) { result[i].push_back(result[i-1][j-1]+result[i-1][j]); } result[i].push_back(1); } return result; }};
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
- Java中join、sleep、wait、yield浅析
- Effective Java, 2nd - Concurrency - Notes
- No handlers could be found for logger "stomp.py"
- 循环中给元素绑定事件
- AES加密
- Pascal's Triangle
- android 源码和CM源码下载地址
- 菜鸟眼中的springMVC
- UVa 1555 Garland 解题报告(推导)
- 浅谈onInterceptTouchEvent、onTouchEvent与onTouch
- hdu 1878 欧拉回路
- HDU1128--Self Numbers
- 算法3:找出一个整数数组里面两个查值最大的两个下标a[j]-a[i]最大并且i<j
- 通过http请求服务