Leetcode 119. 杨辉三角 II

C(n,0) C(n,1) C(n,2) ……C(n,n)

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> ans(1,1);
        for(int k=1;k<=rowIndex;++k) ans.push_back((long long)ans.back()*(rowIndex+1-k)/k);
        return ans;
    }
};