Triángulo de Pascal II

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        if (rowIndex == 0) {
            vector<int> v{1};
            return v;
        }

        if (rowIndex == 1) {
            vector<int> v{1, 1};
            return v;
        }

        vector<int> prev{1, 1};
        vector<int> curr(rowIndex + 1);
        for (int i{2}; i <= rowIndex; i++) {
            curr[0] = 1;
            curr[i] = 1;
            for (int j{1}; j < i; j++) {
                curr[j] = prev[j - 1] + prev[j];
            }
            prev = curr;
        }
        return curr;
    }
};