白话版 动态规划法

class Solution:
    def minimumTotal(self, triangle):
        """
        :type triangle: List[List[int]]
        :rtype: int
        """
        for m in range(len(triangle)-1)[::-1]:
            # m 为 主数组索引
            if (m == len(triangle)-1):
                pass
            # n 为当前元素索引
            for n in range(len(triangle[m])):
                triangle[m][n] = min(triangle[m][n]+triangle[m+1][n], triangle[m][n]+triangle[m+1][n+1])
                print("第",m,"行", "第",n,"个元素当前值为", triangle[m][n])      
                
        return triangle[0][0]
                
            
def main():

    result = Solution().minimumTotal([[2], [3, 4], [6, 5, 7], [4, 1, 8, 3]])     
    print("最短路径为==>",result)
            
        
if __name__ == '__main__':
    main()