Problem Solving/리트코드(leetcode)
Pascal's Triangle
높은곳에영광
2022. 1. 16. 23:13
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> arr;
vector<int> rows;
for(int i = 0; i < numRows; i++) {
rows.clear();
for(int j = 0; j < i+1; j++) {
if(j == 0 || j == i) rows.push_back(1);
else rows.push_back(arr[i-1][j-1] + arr[i-1][j]);
}
arr.push_back(rows);
}
return arr;
}
};