LeetCode/solutions/cpp/0118.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> ans;

        for (int i = 1; i <= numRows; i++)
            ans.push_back(vector<int>(i, 1));

        for (int i = 2; i < numRows; i++)
            for (int j = 1; j < ans[i].size() - 1; j++)
                ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j];

        return ans;
    }
};