By starting at the top of the triangle below and moving to adjacent numbers on the row below, 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
我得到的答案是1064。但他们说这是错误的。帮我…在Python2.7中
这是我的代码:s='''Here the sequence'''
s=s.split("\n")
value=0
total=0
for x in range(len(s)):
y=s[x].split()
if (value+1)>x:
total+=int(y[value])
print int(y[value])
else:
if int(y[value])>int(y[value+1]):
total+=int(y[value])
print int(y[value])
else:
total+=int(y[value+1])
print int(y[value+1])
value+=1
print "Total:::%d"%total