一道算法题，用python初始化一颗二叉树并求解其最短路径的值

Answer 1

用java写的，楼主看看

https://github.com/terry83299387/MyTest/blob/master/BinaryTreeMinSum.java

Answer 2

我觉得是简单dp(瞎说的

Answer 3

动态规划中的入门问题。

Answer 4

def minPathSum(node):
    if not node:
        return 0
    return min(minPathSum(node.left), minPathSum(node.right)) + node.val

Answer 5

用php试了下，可以看看https://github.com/chianquan/Mytest/blob/master/shortest.php

Answer 6

应该是树形DP吧

Answer 7

leetcode上有类似的，不过只是求跳数的题目：https://leetcode.com/problems/minimum-depth-of-binary-tree/

这是我的python实现，你稍微改一下就行

class Solution(object):
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
       
        if root is None:
            return 0
        if root.left is None:
            return 1 + self.minDepth(root.right)
        if root.right is None:
            return 1 + self.minDepth(root.left)
        return 1 + min(self.minDepth(root.left), self.minDepth(root.right))