LeetCode Pascal's Triangle II

Pascal's Triangle II

Given an index k, return the k^th row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

Note:
Could you optimize your algorithm to use only O(k) extra space?

Solution:

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> result;
        if(rowIndex<0)
            return result;
        result.push_back(1);
        for(int i=0;i<rowIndex;++i){
            result.push_back(0);
            for(int j=result.size()-1;j>0;--j){
                result[j]+=result[j-1];
            }
        }
        return result;
    }
};