Binary Tree Maximum Path Sum

最新推荐文章于 2013-10-19 13:42:43 发布

a83610312

最新推荐文章于 2013-10-19 13:42:43 发布

阅读量1.5k

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/a83610312/article/details/11019715

版权

LeetCode 专栏收录该内容

74 篇文章 0 订阅

订阅专栏

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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
#define INVALID_MIN -10000
class Solution {
public:
    int maxPathSum(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
    	if ( !root ) 
			return 0;
		int sum=0,path=0;
		solve(root,sum,path);
		return sum;
    }
	void solve(TreeNode* root,int& sum,int& path)
	{
		if ( !root )
		{
			sum=path=INVALID_MIN;
			return;
		}
		int lsum=0,lpath=0;
		solve(root->left,lsum,lpath);
		int rsum=0,rpath=0;
		solve(root->right,rsum,rpath);

		path=max(root->val,max(lpath,rpath)+root->val);
		sum=max(max(lsum,rsum),lpath+rpath+root->val);
		sum=max(sum,path);
	}
};