The Triangle 经典DP

 

Description

正在上传…
取消
 
Figure 1 shows a number triangle. Write a program that calculates

 the highest sum of numbers passed on a route that starts at the top and ends somewhere 

on the base. Each step can go either diagonally down to the left or diagonally down

 to the right.

Input

The input consists of several test cases. 
For each testcase,The first line contains one integer N: the number of rows in the triangle.

 The following N lines describe the data of the triangle.

 The number of rows in the triangle is > 1 but <= 100. 

The numbers in the triangle, all integers, are between 0 and 99.

Output

Your program is to write to standard output. The highest sum is written as an integer.
Each testcase output one line.

Sample Input

5
7
3 8
8 1 0 
2 7 4 4
4 5 2 6 5

Sample Output

30

代码1

 

 

代码2

 

代码3

更多做题心得的详情请查看（记得关注哦）https://mp.weixin.qq.com/s?__biz=MzIyOTM4MDMxNw==&mid=2247483798&idx=1&sn=d4fbd34e50ce4efda39d7710d2dc5dc9&chksm=e842d824df3551320d7f1ed85286b2616aec419f7a852cc5c9c9f270beb237b5e6ca83166162&token=1630951018&lang=zh_CN#rd