Largest sum from adjacent path

LargestSum.java

Map<Integer, Integer[]> values = populate(); // should typically be a 2D array of type 'int' instead
for (int i = values.size() - 2; i >= 0; i--) {
	for (int j = 0; j <= i; j++) {
		values.get(i)[j] += 
		    Math.max(values.get(i + 1)[j], values.get(i + 1)[j + 1]);
	}
}
int largestPathSum = values.get(0)[0];