-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPascalsTriangle.ts
38 lines (33 loc) · 1.02 KB
/
PascalsTriangle.ts
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
// Source : https://leetcode.com/problems/pascals-triangle/
// Author : squxq
// Date : 2023-11-05
/*****************************************************************************************************
*
* Given an integer numRows, return the first numRows of Pascal's triangle.
*
* In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:
*
* Example 1:
* Input: numRows = 5
* Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
* Example 2:
* Input: numRows = 1
* Output: [[1]]
*
* Constraints:
*
* 1 <= numRows <= 30
******************************************************************************************************/
export function generate(numRows: number): number[][] {
const result: number[][] = [[1]];
for (let i: number = 1; i < numRows; i++) {
const row: number[] = new Array(i + 1);
row[0] = 1;
row[i] = 1;
for (let j: number = 1; j < i; j++) {
row[j] = (row[j - 1] as number) * ((i + 1 - j) / j);
}
result.push(row);
}
return result;
}