Euler P18 E

3
7 4
2 4 6
8 5 9 3

Euler P18 Q

75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 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 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

Euler P18.java

public void p18_67() {
	try {

		Scanner lineIn = new Scanner(new File("p18.txt"));
		ArrayList lines = new ArrayList();

		while (lineIn.hasNext()) {
			lines.add(lineIn.nextLine());
		}

		int[][] tri = new int[lines.size()][];

		for (int i = 0; i < lines.size(); i++) {
			tri[i] = new int[i + 1];

			for (int pos = 0; pos < tri[i].length; pos++) {
				tri[i][pos] += max(tri[i + 1][pos], 
                                                   tri[i + 1][pos + 1]);
			}
		}

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

	} catch (FileNotFoundException e) {}
}

public int max(int a, int b) {
	if (a >= b) {
		return a;
	}
	return b;
}