/*数字三角形问题 问题描述： 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 编程任务： 对于给定的由n行数字组成的数字三角形,编程计算从三角形的顶至底的路径经过的数字和的最大值-/ * Digital triangle Issue Descr iption : given an OK by the number n of triangular figures shown in the diagram below. Design of a test algorithm, calculated from the top of the triangle to the end of a path, the path through the largest sum of the figures. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 programming tasks : for a given n line by the number of digits triangle, triangle programming calculated from the top to the bottom of the path through the figures and the maximum