【LeetCode】Pascal's Triangle II

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