EulerProblem0018.java

//By starting at the top of the triangle below and moving to adjacent numbers on the row below,
//find the maximum total from top to bottom of the triangle.

public static void main(String[] args) {
    int[][] pyramid = new int[15][15];
    int[][] pathCost = new int[15][15];
    String pyramidString = "75\n" +
            "95 64\n" +
            "17 47 82\n" +
            "18 35 87 10\n" +
            "20 04 82 47 65\n" +
            "19 01 23 75 03 34\n" +
            "88 02 77 73 07 63 67\n" +
            "99 65 04 28 06 16 70 92\n" +
            "41 41 26 56 83 40 80 70 33\n" +
            "41 48 72 33 47 32 37 16 94 29\n" +
            "53 71 44 65 25 43 91 52 97 51 14\n" +
            "70 11 33 28 77 73 17 78 39 68 17 57\n" +
            "91 71 52 38 17 14 91 43 58 50 27 29 48\n" +
            "63 66 04 68 89 53 67 30 73 16 69 87 40 31\n" +
            "04 62 98 27 23 09 70 98 73 93 38 53 60 04 23";
    String[] rows = pyramidString.split("\n");
    for (int i = 0; i < 15; i++) {
        String[] row = rows[i].split(" ");
        for (int j = 0; j <= i; j++) {
            pyramid[j][i] = Integer.parseInt(row[j]);
        }
    }
    for (int i = 0; i < 15; i++) pathCost[i][14] = pyramid[i][14];
    int row = 14;
    while (row-- > 0) {
        for (int i = 0; i <= row; i++) {
            pathCost[i][row] = Math.max(pathCost[i][row+1], pathCost[i+1][row+1]) + pyramid[i][row];
        }
    }
    System.out.println(pathCost[0][0]);
}