简单dp就可以:
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> res(rowIndex+1, 1);
for(int i = 0; i < rowIndex+1; ++i){
for(int j = i-1; j > 0; --j){//这儿从右往左,防止值覆盖
res[j] = res[j] + res[j-1];
}
}
return res;
}
};