root/notes
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

vault backup: 2022-06-28 09:31:37

Browse source
This commit is contained in:
juan 2022-06-28 09:31:37 +08:00
parent 07b823fb2d
commit 4f13b2d843
1 changed files with 13 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

29
CS notes/pages/Leetcode Pascal's-Triangle.md
View file

@ -56,7 +56,6 @@ Output: [[1]]
Very simple and straightforward problem. Very simple and straightforward problem.
> [!summary] > [!summary]
> answer[i][j] = answer[i - 1][j - 1] + answer[i - 1][j] > answer[i][j] = answer[i - 1][j - 1] + answer[i - 1][j]
> except for special cases: i <= 1 etc.
I worked around special cases using the for loop in j: j = 1 and j < i. I worked around special cases using the for loop in j: j = 1 and j < i.
@ -64,22 +63,20 @@ I worked around special cases using the for loop in j: j = 1 and j < i.
```cpp ```cpp
class Solution { class Solution {
public: public:
vector<vector<int>> generate(int numRows) { vector<vector<int>> generate(int numRows) {
vector<vector<int>> answer(numRows); vector<vector<int>> answer(numRows);
int sum;
// Initialize vector for (int i = 0; i < numRows; i++) {
answer[0] = vector<int> (1); // initialize sub-array
answer[0][0] = 1; answer[i] = vector<int>(i + 1);
for (int i = 1; i < numRows; i++) {
// initialize sub vector answer[i][0] = 1;
answer[i] = vector<int> (i + 1); for (int j = 1; j < i; j++) {
answer[i][0] = 1; answer[i][j] = answer[i - 1][j] + answer[i - 1][j - 1];
answer[i][i] = 1;
for (int j = 1; j < i; j++) {
answer[i][j] = answer[i - 1][j] + answer[i - 1][j - 1];
}
} }
return answer; answer[i][i] = 1;
} }
return answer;
}
}; };
``` ```