Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
41 lines (37 loc) · 1.08 KB

File metadata and controls

41 lines (37 loc) · 1.08 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package com.sanket.Array;
import java.util.ArrayList;
import java.util.List;
/*
Problem Link - https://leetcode.com/problems/pascals-triangle/
Status - Accepted
*/
public class PascalTriangle {
public static void main(String[] args) {
int num = 3;
generate(num);
}
public static List<List<Integer>> generate(int numRows) {
List<List<Integer>> lists = new ArrayList<>();
if (numRows < 1) { return lists; }
List<Integer> first = new ArrayList<>();
first.add(1);
lists.add(first);
int i = 1;
while (i < numRows) {
List<Integer> integers = new ArrayList<>();
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
integers.add(1);
}
else {
List<Integer> prev = lists.get(i - 1);
int total = prev.get(j - 1) + prev.get(j);
integers.add(total);
}
}
lists.add(integers);
i++;
}
return lists;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.