-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProblem_18.java
32 lines (31 loc) · 1.13 KB
/
Problem_18.java
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
public class Problem_18 {
public static void main(String[] args) {
//@formatter:off
int[][] triangle = { { 75 },
{ 95, 64 },
{ 17, 47, 82 },
{ 18, 35, 87, 10 },
{ 20, 04, 82, 47, 65 },
{ 19, 01, 23, 75, 3, 34 },
{ 88, 02, 77, 73, 7, 63, 67 },
{ 99, 65, 4, 28, 6, 16, 70, 92 },
{ 41, 41, 26, 56, 83, 40, 80, 70, 33 },
{ 41, 48, 72, 33, 47, 32, 37, 16, 94, 29 },
{ 53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14 },
{ 70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57 },
{ 91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48 },
{ 63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31 },
{ 04, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 04, 23 } };//@formatter:on
int answer = 0;
for (int i = triangle.length - 2; i >= 0; i--) {
for (int j = 0; j < triangle[i].length; j++) {
int dl = triangle[i + 1][j];
int dr = triangle[i + 1][j + 1];
if (dl > dr) triangle[i][j] += dl;
else triangle[i][j] += dr;
if (i == 0) answer = triangle[i][j];
}
}
System.out.println(answer);
}
}