118, 119Pascal's Triangle

118 Pascal’s Triangle
输出帕斯卡三角：

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        int n = numRows;
        vector<vector<int>> p(n);
        for (int i = 0; i < n; i++){
            p[i].resize(i+1);
            for (int j = 0; j <= i; j ++){
                if (j == 0 || j == i){
                    p[i][j] = 1;
                } else {
                    p[i][j] = p[i-1][j-1] + p[i-1][j];
                }
            }
        }
        return p;
    }
};

119 Pascal’s Triangle II
输出帕斯卡三角第n行，要求空间复杂度o(n)

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> r(rowIndex+1);
        for (int i = 0; i <= rowIndex; i++){
            for(int j = i; j >= 0; j--){
                if(j == 0 || j == i){
                    r[j] = 1;
                } else {
                    r[j] = r[j] + r[j-1];
                }
            }
        }
        return r;
    }
};