【leetcode】Pascal's Triangle

Pascal’s Triangle

Given numRows, generate the first numRows of Pascal’s triangle.
For example, given numRows = 5,
Return

一层一层计算每个点的值，没有什么特殊的方法

class Solution {public:    vector<vector<int> > generate(int numRows) {        vector<vector<int> > result;        vector<int> row;        if(numRows==0) return result;        for(int i=0;i<numRows;i++)        {            row.clear();            if(i==0)            {                row.push_back(1);                result.push_back(row);            }            else            {   //row.clear();                row.push_back(1);                for(int j=1;j<i;j++)                {                    row.push_back(result[i-1][j-1]+result[i-1][j]);                }                row.push_back(1);                result.push_back(row);            }        }        return result;    }};