LeetCode 119. Pascal’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?

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> v(rowIndex + 1);
        v[0] = 1;
        for(int i = 1; i <= rowIndex; i++) {
            v[i] = (long long int)v[i - 1] *(long long int)(rowIndex - i + 1) / i;
        }
        return v;
    }
};

class Solution {

public:

vector<int> getRow(int rowIndex) {

vector<int> v(rowIndex + 1);

v[0] = 1;

for(int i = 1; i <= rowIndex; i++) {

v[i] = (long long int)v[i - 1] *(long long int)(rowIndex - i + 1) / i;

}

return v;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版