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 5f84782 commit 2b5643cCopy full SHA for 2b5643c
triangle/Solution.java
@@ -1,14 +1,16 @@
1
public class Solution {
2
public int minimumTotal(List<List<Integer>> triangle) {
3
-
+
4
final int size = triangle.size();
5
if(size == 0) return 0;
6
if(size == 1) return triangle.get(0).get(0);
7
8
int[] s = new int[size];
9
10
int i = 0;
11
- for(int v : triangle.get(size - 1)) s[i++] = v;
+ for(int v : triangle.get(size - 1)){
12
+ s[i++] = v;
13
+ }
14
15
for(i = size - 2; i >=0 ; i--){
16
List<Integer> step = triangle.get(i);
@@ -19,7 +21,6 @@ public int minimumTotal(List<List<Integer>> triangle) {
19
21
s[j] = Math.min(step.get(j) + s[j], step.get(j) + s[j + 1]);
20
22
}
23
- s[step.size()] = Integer.MAX_VALUE;
24
25
26
return s[0];
0 commit comments