[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> > ans;
        vector<int> row;
        if(numRows == 0) return ans;
        row.push_back(1);
        ans.push_back(row);
        if(numRows == 1) return ans;
        row.push_back(1);
        ans.push_back(row);
        if(numRows == 2) return ans;
        for(int i=2;i<numRows;i++){
            vector<int> tmp;
            for(int j=0;j<=i;j++){
                if(j==0||j==i){
                    tmp.push_back(1);
                }
                else{
                    tmp.push_back(ans[i-1][j]+ans[i-1][j-1]);
                }
            }
            ans.push_back(tmp);
        }
        return ans;
    }
};