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
28 lines (25 loc) · 848 Bytes

File metadata and controls

28 lines (25 loc) · 848 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
package leetcode;
import java.util.ArrayList;
import java.util.List;
public class leetcode118Or119 {
public List<List<Integer>> generate(int numRows) {
if (numRows==0) return null;
List<List<Integer>> levels = new ArrayList<List<Integer>>();
List<Integer> level_0=new ArrayList<>();
level_0.add(1);
levels.add(level_0); //加入第一层
for (int i = 1; i <numRows; i++) {
List<Integer> i_level=new ArrayList<>();
i_level.add(1);
for (int j = 2; j <(i+1); j++) {
i_level.add(levels.get(i-1).get(j-1)+levels.get(i-1).get(j-2));
}
i_level.add(1);
levels.add(i_level);
}
return levels;
}
public static void main(String[] args) {
new leetcode118Or119().generate(2);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.