原题链接:Leetcode 119. Pascal’s Triangle II
Given an integer rowIndex
, return the rowIndexth (0-indexed) row of the Pascal’s triangle.
In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:
Example 1:
Input: rowIndex = 3
Output: [1,3,3,1]
Example 2:
Input: rowIndex = 0
Output: [1]
Example 3:
Input: rowIndex = 1
Output: [1,1]
Constraints:
- 0 <= rowIndex <= 33
Follow up:
Could you optimize your algorithm to use only O(rowIndex) extra space?
题目大意:
给了一个数 rowIndex
,要求按数组格式返回杨辉三角的第 rowIndex
行
方法一:递推
思路:
构造完整的杨辉三角,然后输入第n行即可
c++代码:
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<vector<int>> ans(rowIndex + 1);
for(int i = 0; i <= rowIndex; i++ ){
ans[i].resize(i + 1);
ans[i][0] = ans[i][i] = 1;
// 中间项由上一行的对应两项求和
for(int j = 1; j < i; j++ ){
ans[i][j] = ans[i-1][j-1] + ans[i-1][j];
}
}
return ans[rowIndex];
}
};
Python3 代码:
class Solution:
def getRow(self, rowIndex: int) -> List[int]:
res = [[1]]
for i in range(rowIndex):
cur = [a+b for a, b in zip([0] + res[-1], res[-1] + [0])]
res.append(cur)
return res[-1]
复杂度分析:
- 时间复杂度:O(rowIndex2),总共计算1 + 2 + …… + rowIndex
- 空间复杂度:O(n),实际上存储了1~n行
优化:
思路:
题目只要求求第n行,上面的方法其实求出了1~n行,开销可以缩小。
原先在二维数组中存了1~n行,可以对空间复杂度进行优化,只存第n行。
采用 更新数组 的思想,但每次更新时从后往前更新,这样不影响后面的数
c++代码:
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> ans(rowIndex + 1);
ans[0] = 1;
for (int i = 1; i <= rowIndex; i++ ) {
// 从后往前更新
for (int j = i; j > 0; --j) {
ans[j] = ans[j] + ans[j - 1];
}
}
return ans;
}
};
复杂度分析:
- 时间复杂度:O(rowIndex2),时间复杂度不变
- 空间复杂度:O(1),输出不算入复杂度