[LeetCode]Pascal's Triangle
2015-02-09 13:58
423 查看
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]
]
这道题很简单,就是求杨辉三角。写的时候只要细心点注意边界值就可以了。这里贴上两张wiki上的杨辉三角的图片:
![](http://img.blog.csdn.net/20150209135601171)
![](http://img.blog.csdn.net/20150209135644958)
下面贴上代码:
For example, given numRows = 5,
Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
这道题很简单,就是求杨辉三角。写的时候只要细心点注意边界值就可以了。这里贴上两张wiki上的杨辉三角的图片:
下面贴上代码:
class Solution { public: vector<vector<int> > generate(int numRows) { vector<vector<int> > ans; vector<int> cld; for (int i = 0; i < numRows; i++){ cld.resize(i + 1); for (int j = 0; j <= i; j++){ if (j == 0 || j == i) cld[j] = 1; else cld[j] = ans[i - 1][j - 1] + ans[i - 1][j]; } ans.push_back(cld); } return ans; } };
相关文章推荐
- 【LeetCode】Pascal's Triangle (杨辉三角)
- Leetcode #118 Pascal's Triangle
- [leetcode]Pascal's Triangle
- LeetCode:Pascal's Triangle
- leetcode118. Pascal's Triangle
- leetcode-Pascal's Triangle
- 和大神们学习每天一题(leetcode)-Pascal's Triangle
- [LeetCode] Pascal's Triangle
- LeetCode(118) Pascal's Triangle
- 【leetcode】Pascal's Triangle
- leetcode_num118_Pascal's Triangle
- 【LeetCode】118_Pascal's Triangle
- 【LeetCode】Pascal's Triangle
- leetcode - Pascal's Triangle
- LeetCode118:Pascal's Triangle
- [LeetCode64]Pascal's Triangle
- [leetcode 118]Pascal's triangle
- [LeetCode]Pascal's Triangle
- LeetCode118 Pascal's Triangle
- [leetcode] Pascal's Triangle