118. Pascal's Triangle
2017-12-14 19:23
253 查看
vector<vector<int>> generate(int numRows) { vector<vector<int>> res; if(numRows<=0) return res; res.assign(numRows,vector<int>(1,1)); for(int i=1;i<numRows;i++){ for(int j=1;j<res[i-1].size();j++) res[i].push_back(res[i-1][j]+res[i-1][j-1]); res[i].push_back(1); } return res; }
相关文章推荐
- [勇者闯LeetCode] 118. Pascal's Triangle
- 118. Pascal's Triangle
- 【LeetCode-面试算法经典-Java实现】【118-Pascal's Triangle(帕斯卡三角形)】
- 118 Pascal's Triangle
- 118. Pascal's Triangle
- leetcode 118[easy]---Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle
- LeetCode 118 Pascal's Triangle
- 118 Pascal's Triangle
- [leetcode-118]Pascal's Triangle(c++)
- 【LeetCode】 118. Pascal's Triangle
- leecode 解题总结:118. Pascal's Triangle
- [LeetCode] 118. Pascal's Triangle
- LeetCode-118-Pascal's Triangle(帕斯卡的三角形)
- 2017.11.14 LeetCode - 118. Pascal's Triangle - 119. Pascal's Triangle II
- 118 Pascal's Triangle
- LeetCode---(118)Pascal's Triangle
- leetcode:118 Pascal's Triangle-每日编程第二十四题
- leetcode——118—— Pascal's Triangle