numeric-trapezium
代码说明:
一个数字梯形,选择k条路线,每条路线从第一层的某个数开始,每次进入下一层到达左下或者右下的数字,直到最后一层为止。每条路线不能经过相同的路径,但是可以经过相同的数字节点。 输出一个整数,表示能得到的最大的k条路径经过的数字之和(A digital ladder, the K route, each route the first layer of a number, each time to enter the next layer to reach the left or right next to the number, until the final layer. Each route can not pass through the same path, but can pass through the same number of nodes. Output an integer representing the sum of the number of the largest K paths that can be obtained)
文件列表:
数字梯形问题描述.doc,22528,2015-10-07
下载说明:请别用迅雷下载,失败请重下,重下不扣分!