Pascal's Triangle Solution || C++ || DP || time(n*n)

class Solution
{
public:
vector<vector> generate(int numRows)
{
vector<vector>vec(numRows);

    for(int i=0; i<numRows; i++)
    {
        vec[i].resize(i+1);
        vec[i][0]=vec[i][i]=1;
        for(int j=1; j<i; j++)
        {
            vec[i][j]=vec[i-1][j-1]+vec[i-1][j];
        }
    }
    
    return vec;
}

};

Comments (0)