LeetCode之Pascal's Triangle

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]
]

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        vector<vector<int>> rst;
        if(numRows<1)  return rst;
        vector<int> tmp;
        rst.push_back(vector<int>(1,1));
        
        for(int i=2;i<=numRows;i++){
            tmp.clear();
            for (int j = 1; j <=i; j++){
                if(j==1||j==i) 
                    tmp.push_back(1);
                else
                    tmp.push_back(rst[i-2][j-2]+rst[i-2][j-1]);
            }
            rst.push_back(tmp);
        }
         return rst;
        
    }
};