*Leetcode_binary-tree-maximum-path-sum (updated c++ and python version)

62 篇文章 0 订阅
52 篇文章 0 订阅

地址:http://oj.leetcode.com/problems/binary-tree-maximum-path-sum/

Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

For example:
Given the below binary tree,

       1
      / \
     2   3

Return 6.

思路:dfs。对于某个节点,算sum的时候加上左右子树的dfs与0的较大值。但向上返回的时候,只返回节点值与(左右子树的dfs与0三者的最大值)的和。

感觉这道题想通比较难,有提示就好一点,山重水复与柳暗花明只有一步之隔。

参考代码:

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int ans;
    int dfs(TreeNode* root)
    {
        if(!root)
            return 0;
        int left = dfs(root->left);
        int right = dfs(root->right);
        int sum = root->val + max(left, 0) + max(right, 0);
        ans = max(ans, sum);
        return max(max(left, right), 0) + root->val;
    }
public:
    int maxPathSum(TreeNode *root) {
        ans = INT_MIN;
        dfs(root);
        return ans;
    }
};

 
 
//SECOND TRIAL
class Solution {
private :
     int ans = INT_MIN ;
     int find_max ( TreeNode * root )
     {
         if ( ! root )
             return 0 ;
         int left = find_max ( root -> left );
         int right = find_max ( root -> right );
         ans = max ( ans , root -> val + max ( 0 , left ) + max ( 0 , right ));
         return root -> val + max ( 0 , max ( left , right ));
     }
public :
     int maxPathSum ( TreeNode * root ) {
         if ( ! root )
             return 0 ;
         find_max ( root );
         return ans ;
     }
};


python:

  
  
# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class Solution :
     def __init__ ( self ):
         self . ans = - 10000000 # since -sys.maxint could not be used in leetcode oj
     def dfs ( self , root ):
         if not root :
             return 0
         lval = self . dfs ( root . left )
         rval = self . dfs ( root . right )
         self . ans = max ( self . ans , root . val + max ( 0 , lval ) + max ( 0 , rval ))
         return root . val + max ( 0 , max ( lval , rval ))
     # @param root, a tree node
     # @return an integer
     def maxPathSum ( self , root ):
         if not root :
             return 0 ;
         self . dfs ( root )
         return self . ans

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值