[LeetCode] 杨辉三角

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> tmp_data;
        if(numRows == 0)
            return tmp_data;
        tmp_data.push_back(vector<int>(1, 1));
        if(numRows == 1)
            return tmp_data;
        tmp_data.push_back(vector<int>(2, 1));
        if(numRows == 2)
            return tmp_data;
        for(int i = 3; i <= numRows; i++){
            vector<int> tmp;
            tmp.push_back(1);
            for(int j = 0; j < tmp_data[tmp_data.size() -1 ].size()-1; j++){
                tmp.push_back(tmp_data[tmp_data.size() -1 ][j] + tmp_data[tmp_data.size() -1 ][j+1]);
            }
            tmp.push_back(1);
            tmp_data.push_back(tmp);
        }
        return tmp_data;
    }
};