Leetcode 119. Pascal’s Triangle II

Poby’s Home

·

Follow

Jun 21, 2022

--

Share

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