We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent aae165a commit 24d79e8Copy full SHA for 24d79e8
118. Pascal's Triangle
@@ -0,0 +1,25 @@
1
+class Solution {
2
+ public List<List<Integer>> generate(int numRows) {
3
+ List<List<Integer>> result = new ArrayList<>();
4
+ if(numRows == 0) return result;
5
+
6
+ List<Integer> row = new ArrayList<>();
7
+ row.add(1);
8
+ result.add(row);
9
10
+ List<Integer> prevRow = row;
11
12
+ for(int i = 1; i < numRows; i++) {
13
+ List<Integer> currentRow = new ArrayList<>();
14
+ currentRow.add(1);
15
+ for(int j = 1; j < i; j++) {
16
+ currentRow.add(prevRow.get(j) + prevRow.get(j-1));
17
+ }
18
19
+ result.add(new ArrayList<>(currentRow));
20
+ prevRow = currentRow;
21
22
23
+ return result;
24
25
+}
0 commit comments