LeetCode:Pascal's Triangle一

#include<iostream>#include<string>#include<vector>using namespace std;vector<vector<int> > generate(int numRows) {// IMPORTANT: Please reset any member data you declared, as// the same Solution instance will be reused for each test case.vector<vector<int> >res;if (numRows == 0)return res;res.push_back(vector<int>{1});if (numRows == 1)return res;vector<int>tmp;tmp.reserve(numRows);for (int i = 2; i <= numRows; i++){tmp.clear();tmp.push_back(1);for (int j = 1; j < i - 1; j++)tmp.push_back(res[i - 2][j - 1] + res[i - 2][j]);tmp.push_back(1);res.push_back(tmp);}return res;}int main(){vector<vector<int>> res = generate(5);for (int i = 0; i < res.size(); i++){for (int j = 0; j < res[i].size(); j++){cout << res[i][j];}cout << endl;}system("pause");return 0;}