题目:
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] ]
思路:将三角形左边对齐后发现,除了每一行的最左边和最右边,tri[i][j]=tri[i-1][j-1]+tri[i-1][j]
class Solution {
public:vector<vector<int>> generate(int numRows) {
vector<vector<int>> ivec;
for(int i=0;i<numRows;i++)
{ vector<int> vec;
for(int j=0;j<i+1;j++)
{
if(j==0||j==i)
vec.push_back(1);
else
vec.push_back(ivec[i-1][j-1]+ivec[i-1][j]);
}
ivec.push_back(vec);
}
return ivec;
}
};