题目描述
思路分析
状态机+线性dp
f
[
i
]
[
j
]
f[i][j]
f[i][j]:状态i下的第j个数
f
[
i
a
n
d
1
]
[
j
]
=
f
[
i
−
1
a
n
d
1
]
[
j
−
1
]
+
f
[
i
−
1
a
n
d
1
]
[
j
]
f[i \ and\ 1][j]=f[i-1\ and\ 1][j-1]+f[i-1\ and\ 1][j]
f[i and 1][j]=f[i−1 and 1][j−1]+f[i−1 and 1][j]
代码实现
class Solution {
public:
vector<int> getRow(int n) {
vector<vector<int>> f(2,vector<int>(n+1));
for(int i=0;i<=n;i++){
f[i&1][0]=f[i&1][i]=1;
for(int j=1;j<i;j++){
f[i&1][j]=f[i-1&1][j-1]+f[i-1&1][j];
}
}
return f[n&1];
}
};