(算法)Binary Tree Max 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 does not need to go through the root.

For example:
Given the below binary tree,

       1
      / \
     2   3

 

Return 6.

思路:

递归

代码:

#include<iostream>
#include<stdlib.h>

using namespace std;

struct TreeNode{
    int val;
    TreeNode* left;
    TreeNode* right;
};

int maxPathSum(TreeNode *root,int &maxDist){
    if(root==NULL)
        return 0;

    int lmax=maxPathSum(root->left,maxDist);
    int rmax=maxPathSum(root->right,maxDist);

    if(lmax+rmax+root->val>maxDist)
        maxDist=lmax+rmax+root->val;

    return max(0,root->val+max(lmax,rmax));
}

int main(){

    return 0;
}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值