Maximum path sum I

https://projecteuler.net/problem=18

Maximum path sum I

Problem 18

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

3
7 4
2 4 6
8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom of the triangle below:

75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However,Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)

这个题和上个题一样，每个的值都是上面两个值较大的一个加上他自己，自上到下，算一遍，结果就出来了，也不复杂。

#基础数据集合datalist = []for line in open("data.txt",'r'):    temp = list(map(int,line.split(' ')))    datalist.append(temp)#准备结果集合resultlist = []for i in range(0,len(datalist)):    resultlist.append([0] * len(datalist[i]))#结果集初始化,第一个和最后一个直接更新resultlist[0][0] = datalist[0][0]for i in range(1,len(datalist)):    resultlist[i][0] = datalist[i][0] + resultlist[i-1][0]    resultlist[i][len(datalist[i]) - 1] = resultlist[i-1][len(datalist[i])-2] + datalist[i][len(datalist[i]) - 1]#计算结果，中间的值进行更新for i in range(1,len(datalist)):    for j in range(1,len(datalist[i]) - 1):        resultlist[i][j] = max(resultlist[i-1][j-1],resultlist[i-1][j]) + datalist[i][j]#获取最大值maxpath = 0line = len(resultlist) - 1for i in range(0,len(resultlist[line])):    if maxpath < resultlist[line][i]:        maxpath = resultlist[line][i]print(maxpath)