计算最大金额可能当遍历一个三角形的整数，从上到下的java程序。

This Java program finds the maximum sum of a traversal path through a triangle of numbers. A path can be formed through a triangle of numbers by starting at the top and repeatedly moving down one row at each step, and then choosing one of the two immediately diagonal elements. For example, the sum of the maximum traversal path for the given triangle below is 23: 3 7 4 2 4 68 5 9 3 That is, 3 + 7 + 4 + 9 = 23. This program loads the triangle data from a file and works for any number of rows.

triangle_2000_rows.txt
readme.txt
SolveTriangle.bat
TestTriangle.bat
triangle.txt
lib
junit-4.10.jar
triangle.jar
source
src
test