-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpascalTriangle.js
74 lines (60 loc) · 1.47 KB
/
pascalTriangle.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/**
* @param {number} numRows
* @return {number[][]}
*/
var generate = function (numRows) {
let pascalTriangle = [];
for (let i = 0; i < numRows; i++) {
pascalTriangle[i] = [];
pascalTriangle[i][0] = 1;
pascalTriangle[i][i] = 1;
for (let j = 1; j < i; j++) {
pascalTriangle[i][j] =
pascalTriangle[i - 1][j - 1] + pascalTriangle[i - 1][j];
}
}
return pascalTriangle;
};
// Just return the last row of the Pascal's Triangle
/**
* @param {number} rowIndex
* @return {number[]}
*/
var getRow = function (rowIndex) {
let row = new Array(rowIndex + 1).fill(1);
for (let i = 1; i < rowIndex; i++) {
for (let j = i; j > 0; j--) {
row[j] += row[j - 1];
}
}
return row;
};
// C++ cos who doesn't like it?
/*
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> pascalTriangle = {};
for (int i = 0; i < numRows; i++) {
vector<int> row(i + 1, 1);
for (int j = 1; j < i; j++) {
row[j] = pascalTriangle[i - 1][j - 1] + pascalTriangle[i - 1][j];
}
pascalTriangle.push_back(row);
}
return pascalTriangle;
}
};
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> row(rowIndex + 1, 1);
for (int i = 1; i < rowIndex; i++) {
for (int j = i; j > 0; j--) {
row[j] += row[j - 1];
}
}
return row;
}
};
*/