LeetCode OJ - 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?

解题思路：

　　方法一：直接将杨辉三角都计算出来，然后返回第k行，但这样空间复杂度不合题意。

　　方法二：直接计算第k行。第k行的元素为 C_k⁰...._^Ck^k

代码：

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> ans;
        ans.push_back(1);
        
        if (rowIndex == 0) return ans;
        
        int cur = ans[0];
        for (int i = 1; i <= rowIndex; i++) {
            cur = cur * (double)(rowIndex/*n*/ - i + 1) / i;
            ans.push_back(cur);
        }
        return ans;
    }
};

 

转载于:https://www.cnblogs.com/dongguangqing/p/3727874.html