Maximum Path Sum II

Problem $67$

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

$3$

$74$

$246$

$8593$

That is$,3+7+4+9=23.$

Find the maximum total from top to bottom in triangle.txt $($right click and 'Save Link$/$Target As$...\text{'}),$ a $15$K text file containing a triangle with one$-$hundred rows.

It is not possible to try every route to solve this problem, as there are $2^99$ altogether! If you could check one trillion $(10^12)$ routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it$.$ ;o$)$ solve this in JAVA