C++ 杨辉三角

Posted 2021-09-01 L_add

杨辉三角

题目来源：力扣

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> vv;
        vv.resize(numRows);
        for(size_t i = 0;i <vv.size();i++)
        {
            vv[i].resize(i+1);
        }
        for(size_t i = 0;i < vv.size();i++)
        {
            vv[i][0] = vv[i][vv[i].size()-1] = 1;
        }
        for(int i = 0;i <vv.size();i++)
        {
            for(int j = 0;j<vv[i].size();j++)
            {
                if(vv[i][j] != 1)
                {
                    vv[i][j] = vv[i-1][j]+vv[i-1][j-1];
                }
            }
        }
    return vv;

    }
};