LeetCode118:Pascal's Triangle
Posted yxysuanfa
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode118:Pascal's Triangle相关的知识,希望对你有一定的参考价值。
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] ]
Subscribe to see which companies asked this question
//解题思路:利用一个中间vector来保存每层的数 class Solution { public: vector<vector<int> > generate(int numRows) { vector<vector<int>> ans; for(int i = 0;i < numRows;i++) { vector<int> cur; if(i == 0) cur.push_back(1); else { for(int j = 0;j <= i;j++) { if(j == 0 || j == i) cur.push_back(1); else cur.push_back(ans[i - 1][j] + ans[i - 1][j - 1]); } } ans.push_back(cur); } return ans; } };
以上是关于LeetCode118:Pascal's Triangle的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode-118-Pascal's Triangle]
leetcode 118 Pascal's Triangle ----- java
[LeetCode] NO. 118 Pascal's Triangle