[LeetCode]Pascal's Triangle
2013-05-30 10:27
441 查看
class Solution {
public:
vector<vector<int> > generate(int numRows) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > ans;
ans.resize(numRows);
for(int i = 0; i < numRows; ++i)
ans[i].assign(i+1, 1);
//
for(int i = 0; i < numRows; ++i)
{
for(int j = 1; j <= i-1; ++j)
ans[i][j] = ans[i-1][j-1]+ans[i-1][j];
}
//
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode pascal's triangle
- Pascal's Triangle -leetcode
- 【LeetCode】Pascal's Triangle (杨辉三角)
- LeetCode－118. Pascal's Triangle，119. Pascal's Triangle II
- Leetcode Pascal's Triangle
- [leetcode]Pascal's Triangle II
- LeetCode Pascal's Triangle 打印杨辉三角
- leetcode:pascal's_triangle_II
- leetcode: Pascal's Triangle | Java最短代码实现
- LeetCode 118. Pascal's Triangle
- LeetCode (13) Pascal's Triangle (杨辉三角 )
- LeetCode Pascal's Triangle
- LeetCode Pascal's Triangle
- leetcode -- Pascal's Triangle -- 简单
- leetcode-118&119 Pascal's Triangle I & II
- [leetCode 118 & 119] Pascal's Triangle I && II (杨辉三角问题)
- leetcode:118 Pascal's Triangle－每日编程第二十四题
- (LeetCode)Pascal's Triangle --- 杨辉三角
- LeetCode|Pascal's Triangle-java
- LeetCode | Pascal's Triangle（杨辉三角）