• [LeetCode#124]Binary Tree Maximum Path Sum


    The problem:

    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.

    My analysis:

    This problem could be classified as a different kind of recursion problems.
    The classfication: from bottom to surface, without using value(except the answer set, and cur_root information) from previous level.
    To solve this problem: we could only make decision from post level(it is a very normal pattern to use recursion on binary tree).
    At each recursion level, we need following thinking:
    1. compute the longest(max) path for left-sub tree.
    2. compute the longest(max) path for right-sub tree.
    3. compute the maximum sum for current node.

    3.1 iff longest(left) > 0, we include it. 
    3.2 iff longest(right) > 0, we include it.

    4. return the longest path for current node. this part should be treated very carefully, it's different from the maximum sum we want to compute. we should only choose include either left longest path, right longest path or only the current node itself.

    return cur_root.val + Math.max(left_max, Math.max(0, right_max));

    5. One very important thing. Since the problem allows the path to start from any node, we should keep a global max value we have found out. Not only the value at root.(the root node only contain information from it)

    My solution:

    public class Solution {
        public int maxPathSum(TreeNode root) {
            
            if(root == null)
                return 0;
            
            ArrayList<Integer> max = new ArrayList<Integer>();
            max.add(Integer.MIN_VALUE);
            
            helper(root, max);
            
            return max.get(0);
        }
        
        private int helper(TreeNode cur_root, ArrayList<Integer> max) {
            
            if (cur_root == null)
                return 0;
            
            int left_max = helper(cur_root.left, max);
            int right_max = helper(cur_root.right, max);
            int cur_max = cur_root.val;
    
            if (left_max > 0)
                cur_max += left_max;
            
            if (right_max > 0)
                cur_max += right_max;
            
            if (cur_max > max.get(0))
                max.set(0, cur_max);
            
            return cur_root.val + Math.max(left_max, Math.max(0, right_max)); //a little tricky skill 
        }
    }
  • 相关阅读:
    STM32中断优先级理解
    STM32按键控制程序
    STM32的LED驱动程序
    嵌入式程序员应知道的0x10个C语言Tips[转]
    【Unity】使用RenderTexture为物体生成快照
    对装饰模式(Decorator)的解读
    设计模式之初:理解面向对象设计
    windows RT系统下解决网络丢包问题
    IOS推出测试平台
    小米路由试用心得3——关于数据备份及客户端软件
  • 原文地址:https://www.cnblogs.com/airwindow/p/4215984.html
Copyright © 2020-2023  润新知