Add comments to explain, use Java or psuedocode.

Some positive integers are arranged in a triangle like the one shown in Figure below. Design an algorithm (more efficient than an exhaustive search, of course) to find the largest sum in a descent from its apex to the base through a sequence of adjacent numbers, one number per each level. 2 4 3 4 7 1