LeetCode 0119 - Pascal's Triangle II

Reck Zhang

发布于 2021-08-11 10:57:08

1300

发布于 2021-08-11 10:57:08

文章被收录于专栏：Reck Zhang

Pascal’s Triangle II

Desicription

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?

Solution

class Solution {
private:
    int C(double A, double B) {
        double res = 1;
        for(int i = 1; i <= B; i++)
            res *= (double)(A-i+1)/i;
        return res+0.5;
    }
public:
    vector<int> getRow(int rowIndex) {
        vector<int> res;
        for(int i = 0; i <= rowIndex; i++)
            res.push_back(C(rowIndex, i));
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-12-18，如有侵权请联系 cloudcommunity@tencent.com 删除

algorithm