leetcode刷题，总结，记录，备忘 119

leetcode119Pascal's Triangle II

Given an index k, return the kth 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?

Subscribe to see which companies asked this question

跟Pascal's Triangle I类似，根据k的大小，进行相应的迭代即可。

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> temp, t;
        temp.push_back(1);
        if (rowIndex == 0)
        {
            return temp;
        }
        
        for (int i = 1; i <= rowIndex; ++i)
        {
            temp.push_back(0);
            t = temp;
            for (int j = 1; j <= i; ++j)
            {
                t[j] = temp[j] + temp[j-1];
            }
            temp = t;
        }
        
        return t;
    }
};