[leetcode]119. Pascal’s Triangle II
Analysis
control—— [miao~]
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.
杨辉三角,返回指定行的值.
第二中方法是对第一种方法的优化,把空间复杂度减少到O(k)
补充一个杨辉三角的公式:result[i]=result[i-1]*(rowIndex-i+1)/i(用这个公式也可以求解)
Implement
第一种方法
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> t1;
t1.push_back(1);
if(rowIndex == 0)
return t1;
for(int i=1; i<=33; i++){
t1.push_back(0);
vector<int> t2 = t1;
for(int j=1; j<=i; j++)
t2[j] = t1[j-1] + t1[j];
t1 = t2;
if(i == rowIndex)
return t2;
}
}
};
第二种方法
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> t1(rowIndex+1, 1);
if(rowIndex < 2)
return t1;
for(int i=2; i<=rowIndex; i++){
for(int j=i-1; j>0; j--)
t1[j] = t1[j-1]+t1[j];
}
return t1;
}
};