Java.

you are given a pyramid of numbers like the one shown here:

137

42 -15

-4 13 45

21 14 -92 33

Values in the pyramid can be both positive or negative. A path from the top of the pyramid to the bottom consists of starting at the top of the pyramid and taking steps diagonally left or diagonally right down to the bottom of the pyramid. The cost of a path is the sum of all the values in the pyramid.

Find the path from the top of the pyramid to the bottom with the highest total cost.