- class Solution(object):
- def maxPathSum(self, root):
- """
- :type root: TreeNode
- :rtype: int
- """
- if root == None:
- return 0
- Solution.maxsum = root.val
- def solve(root):
- if root == None:
- return 0
- sum,l,r = root.val,0,0
- if root.left:
- l = solve(root.left)
- if l > 0: sum += l
- if root.right:
- r = solve(root.right)
- if r > 0: sum += r
- Solution.maxsum = max(Solution.maxsum,sum)
- #print(Solution.maxsum)
- return max(root.val,max(root.val + l,root.val+r))
- solve(root)
- return Solution.maxsum
124. Binary Tree Maximum Path Sum(python)
猜你喜欢
转载自blog.csdn.net/weixin_41362649/article/details/79983456
今日推荐
周排行