【专知-关关的刷题日记19】Leetcode 118. Pascal's Triangle

 [1],
[1,1],

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>>output;
        if(numRows==0)
            return output;
        vector<int>temp;
        temp.push_back(1);
        output.push_back(temp);
        for(int i=2; i<=numRows; i++)
        {
            vector<int>temp1;            
            for(int i=0; i<=temp.size(); i++)
            {
                if(i==0)
                    temp1.push_back(temp[i]);
                else if(i==temp.size())
                     temp1.push_back(temp[i-1]);
                else
                    temp1.push_back(temp[i]+temp[i-1]);
            }
            temp=temp1;
            output.push_back(temp1);
        }
        return output;
    }
};