119. 杨辉三角 II

119. 杨辉三角 II

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<vector<int>> dp(rowIndex+10);
        if(rowIndex==0)
        {
              dp[0].push_back(1);
              return dp[0];
        }
        if(rowIndex==1)
        {
            dp[0].push_back(1);
            dp[1].push_back(1);dp[1].push_back(1);
            return dp[1];
        }
        dp[0].push_back(1);
        dp[1].push_back(1);dp[1].push_back(1);
        for(int i=2;i<=rowIndex;i++)
        {
            dp[i].push_back(1);
            for(int j=1;j<=i-1;j++)
            {
                dp[i].push_back(dp[i-1][j-1]+dp[i-1][j]);
            }
            dp[i].push_back(1);
        }
        return dp[rowIndex];
    }
};