leetcode_num118_Pascal's Triangle

Given numRows, generate the first numRows of Pascal's triangle.

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

vector初始化 vector<int>(m,n)：向量长度为m,填充数字n