Maximum triangle path sum: Difference between revisions

=={{header|Java}}==

{{works with|Java|8}}

<lang java>import java.nio.file.*;

import java.util.Arrays;

public class MaxPathSum {

public static void main(String[] args) throws Exception {

int[][] data = Files.lines(Paths.get("triangle.txt"))

.map(s -> Arrays.stream(s.trim().split("\\s+"))

.mapToInt(Integer::parseInt)

.toArray())

.toArray(int[][]::new);

for (int r = data.length - 1; r > 0; r--)

for (int c = 0; c < data[r].length - 1; c++) {

int n = data[r - 1][c];

data[r - 1][c] = Math.max(n + data[r][c], n + data[r][c + 1]);

}

System.out.println(data[0][0]);

}

}</lang>

<pre>1320</pre>