Pascal's Triangle II

http://leetcode.com/onlinejudge#question_118

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?

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> a(rowIndex + 1);

        a[0] = 1;
        for(int i = 0; i <= rowIndex; i++)
            for(int j = i; j > 0; j--)
                if (j == 0 || j == i)
                    a[j] = 1;
                else
                    a[j] = a[j-1] + a[j];

        return a;
    }
};