Pascal's Triangle II - Leetcode Solution in C++

       

Pascal's Triangle II

Given an integer numRows,return the rowIndexth (0-indexed) row of the Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:

 

Example 1:

Input: numRows = 3
Output: [1,3,3,1]

Example 2:

Input: numRows = 0
Output: [1] 

Example 3:

Input: numRows = 1
Output: [1,1]

 

Constraints:

• 1 <= numRows <= 33

. . .
Solution in C++.

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

Try the solution on LeetCode: https://leetcode.com/problems/pascals-triangle-ii/