124. Binary Tree Maximum Path Sum

Given a binary tree, find the maximum path sum.

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

For example:
Given the below binary tree,

       1
      / \
     2   3

Return  6.

树中任意两点距离最大值,递归函数的返回值和最后的结果不是一回事:递归函数的返回值是说,对于任意一个节点,它最大的path值是该节点的值加上左子节点和右子节点中比较大的一个(如果左右子树的节点值都小于0,那就不加,或者加0),也就是处理根节点的时候要求,左右子树已经遍历,典型的后序遍历.

     for each node

          int a = maxPathSum(root->left);

           int b = maxPathSum(root->right);

          return max(a,b)>0?max(a,b) + root->val

但是返回值应该是int ret = max( root->val+a>0?a:0+b>0?b:0 , ret )

别忘了还要初始化ret=INT_MIN哦

(*^__^*) 嘻嘻……

int ma=INT_MIN;

int maxPathSum1(TreeNode* root)

{

  if(!root) return 0;

  int a=maxPathSum1(root->left);

  int b=maxPathSum1(root->right);

  if(root->val+(a>0?a:0)+(b>0?b:0)>ma)

  ma=root->val+(a>0?a:0)+(b>0?b:0);

  return root->val+(max(a,b)>0?max(a,b):0);

}

int maxPathSum(TreeNode* root) {

  if(!root) return 0;

  maxPathSum1(root);

  return ma;

}