LeetCode | 119. Pascals Triangle II

 

題目：

Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.

Note that the row index starts from 0.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 3
Output: [1,3,3,1]

Follow up:

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

 

代碼：

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

 

 

加油吧~ 新的一個月，不管結果怎麼樣，坦然接受吧，加油！