LeetCode 119. Pascal's Triangle II

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