118Pascal's Triangle
来源:互联网 发布:js获取文件路径怎么写 编辑:程序博客网 时间:2024/04/30 09:14
class Solution {public: vector<vector<int> > generate(int numRows) { vector<int>vec; vector<vector <int> >ans; if(numRows==0) return ans; vec.push_back(1); ans.push_back(vec); for(int i=1; i<=numRows-1; i++){ int p=0, a=0, b=1; for(;p<i;p++){ vec[p]=a+b; a=b; if(p+1<i) b=vec[p+1]; } vec.push_back(1); ans.push_back(vec); } return ans; }};
0 0
- [118]Pascal's Triangle
- 118Pascal's Triangle
- 118Pascal's Triangle
- 118Pascal's Triangle
- 118 Pascal's Triangle
- 118Pascal's Triangle
- [118] Pascal's Triangle
- 118 Pascal's Triangle
- #118 Pascal's Triangle & #119 Pascal's Triangle II
- LeetCode 118: Pascal's Triangle
- LeetCode(118)Pascal's Triangle
- LeetCode: Pascal's Triangle [118]
- LeetCode 118 Pascal's Triangle
- LeetCode 118 Pascal's Triangle
- [leetcode 118] Pascal's Triangle
- leetCode #118 Pascal's Triangle
- LeetCode 118 :Pascal's Triangle
- leetcode-118 Pascal's Triangle
- Dev-Cpp开发环境配置SDL2库
- 【蓝桥杯练习】历届试题 回文数字
- 黑马程序员——java基础——网络编程
- js中的一切都是对象
- scu集训队第一次周赛记录
- 118Pascal's Triangle
- 详谈调用winpcap驱动写arp多功能工具
- Salesforce 官方扫盲自学导航
- 梯度下降算法
- 2015年3月8日
- Mongodb 安装配置,启动关闭
- leetcode-Add Two Numbers
- C++ 类的大小
- 浅谈矩阵分解在推荐系统中的应用