118. 119. Pascal's Triangle -- 杨辉三角形

118.

Given numRows, generate the first numRows of Pascal's triangle.

For example, given numRows = 5,
Return

[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> ans;
        if(numRows < )
            return ans;
        vector<int> pre, cur;
        pre.push_back();
        ans.push_back(pre);
        for(int i = ; i < numRows; i++)
        {
            cur.push_back();
            for(int j = ; j < pre.size()-; j++)
            {
                cur.push_back(pre[j]+pre[j+]);
            }
            cur.push_back();
            ans.push_back(cur);
            pre = cur;
            cur.clear();
        }
        return ans;
    }
};

119.

Given an index k, return the kth row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> ans(rowIndex+, );
        ans[] = ;
        for(int i = ; i <= rowIndex; i++)
        {
            ans[i] = ;
            for(int j = i-; j > ; j--)
            {
                ans[j] += ans[j-];
            }
        }
        return ans;
    }
};

只开一个数组，从后向前计算。