欧拉计划问题18：我在代码中犯了什么错误？

Question

https://projecteuler.net/problem=18

给定一个整数三角形，问题是从上到下求最大路径和（路径中的所有数字必须相邻）。你知道吗

我有一个算法的想法：从最上面开始，计算左右路径的和（从左到下，从右到下），如果左和更大，跳到左边相邻的数字，如果右和更大，跳到右边相邻的数字，从当前数字开始重复算法，如此一直开到最下面一排。你知道吗

triangle = ['75', '9564', '174782', '18358710', '2004824765', '190123750334', '88027773076367', '9965042806167092', '414126568340807033', '41487233473237169429', '5371446525439152975114', '701133287773177839681757', '91715238171491435850272948', '6366046889536730731669874031', '046298272309709873933853600423']

maximumPath = [75]
maxSum = 75 #Start it with the starting element of the triangle.

def triNum(row, index): #Returns the number at given row, number in row
    return(int(triangle[row][2*index:2*(index+1)])) #Nota bene: returns an integer.

def options(row, index): #Rows start at 0, index starts at 0
    return(triNum(row+1, index), triNum(row+1, index+1))

def criticalPathSum(startRow, startIndex, direction):
    critPath = []
    if direction == 'left':
        directionNum = 0
    else:
        directionNum = 1
    sum = triNum(startRow, startIndex) #Starting sum of left and right paths is just the number at the start of both paths.
    for i in range(startRow + 1, len(triangle)):
        startIndex += directionNum
        sum += triNum(i, startIndex)
        critPath.append(triNum(i, startIndex))
        #print(triNum(i, startIndex + directionNum))
    return(sum, critPath)

pathIndex = 0
for row in range(0, len(triangle)-1):
    print('These are my options: ' + str(options(row, pathIndex)))
    print('Left Sum: ' + str(criticalPathSum(row, pathIndex, 'left')) + ', ' + 'Right Sum: ' + str(criticalPathSum(row, pathIndex, 'right')))
    if criticalPathSum(row, pathIndex, 'left') > criticalPathSum(row, pathIndex, 'right'):
        maximumPath.append(triNum(row + 1, pathIndex))
        print('Left. ' + str(triNum(row + 1, pathIndex)))
    else:
        print('Right. ' + str(triNum(row + 1, pathIndex + 1)))
        pathIndex += 1
        maximumPath.append(triNum(row + 1, pathIndex))
    maxSum += triNum(row + 1, pathIndex)
    print('_______________________________')
    print('\n')
print(maximumPath)
print(maxSum)

答案是1067，但我得到883。根据算法，这是最大路径：

[75, 95, 17, 35, 82, 75, 7, 16, 80, 37, 91, 17, 91, 67, 98].

Answer 1

你的算法是错误的：在一个三角形中

   1
  1 4
 1 4 1
9 1 4 1

它太受9（总是向左）的诱惑而看不到最优的1+4+4+4=13路径。你知道吗