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
40 lines (36 loc) · 869 Bytes

File metadata and controls

40 lines (36 loc) · 869 Bytes
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
import java.util.ArrayList;
/**
* Given numRows, generate the first numRows of Pascal's triangle.
*
* For example, given numRows = 5, Return
*
* [
* [1],
* [1,1],
* [1,2,1],
* [1,3,3,1],
* [1,4,6,4,1]
* ]
*/
public class PascalTriangle {
public ArrayList<ArrayList<Integer>> pascalTriangle(int numRows) {
ArrayList<ArrayList<Integer>> pt = new ArrayList<ArrayList<Integer>>();
int k = 1;
for (int i = 0; i < numRows; i++) {
ArrayList<Integer> r = new ArrayList<Integer>();
for (int j = 0; j < k; j++) {
r.add(1);
}
k++;
pt.add(r);
}
for (int f = 2; f < pt.size(); f++) {
ArrayList<Integer> prev = pt.get(f - 1);
ArrayList<Integer> current = pt.get(f);
for (int g = 1; g < current.size() - 1; g++) {
current.set(g, prev.get(g - 1) + prev.get(g));
}
}
return pt;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.