zoukankan      html  css  js  c++  java
  • [Algo] 140. Maximum Path Sum Binary Tree III

    Given a binary tree in which each node contains an integer number. Find the maximum possible subpath sum(both the starting and ending node of the subpath should be on the same path from root to one of the leaf nodes, and the subpath is allowed to contain only one node).

    Assumptions

    • The root of given binary tree is not null

    Examples

       -5

      /    

    2      11

         /    

        6     14

               /

            -3

    The maximum path sum is 11 + 14 = 25

    Solution 1:

    /**
     * public class TreeNode {
     *   public int key;
     *   public TreeNode left;
     *   public TreeNode right;
     *   public TreeNode(int key) {
     *     this.key = key;
     *   }
     * }
     */
    public class Solution {
      int maxValue = Integer.MIN_VALUE;
      public int maxPathSum(TreeNode root) {
        // Write your solution here
        helper(root, 0);
        return maxValue;
      }
    
      private void helper(TreeNode root, int preSum) {
        if (root == null) {
          return;
        }
        int curSum = preSum < 0 ? root.key : root.key + preSum;
        maxValue = Math.max(maxValue, curSum);
        helper(root.left, curSum);
        helper(root.right, curSum);
      }
    }

    Solution 2:

    /**
     * public class TreeNode {
     *   public int key;
     *   public TreeNode left;
     *   public TreeNode right;
     *   public TreeNode(int key) {
     *     this.key = key;
     *   }
     * }
     */
    public class Solution {
      int maxValue = Integer.MIN_VALUE;
      public int maxPathSum(TreeNode root) {
        // Write your solution here
        helper(root);
        return maxValue;
      }
    
      private int helper(TreeNode root) {
        if (root == null) {
          return 0;
        }
        int left = helper(root.left);
        int right = helper(root.right);
        int curSum = root.key + Math.max(0, Math.max(left, right));
        maxValue = Math.max(maxValue, curSum);
        return curSum;
      }
    }
  • 相关阅读:
    模块三
    python的6种基本数据类型--字典
    python的6种基本数据类型--集合
    数据集之集合
    锚点使用
    JSON返回DateTime/Date('123123123')/解决办法
    JSON返回DateTime/Date('123123123')/解决办法
    设计模式-系列索引
    设计模式-系列索引
    xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12425945.html
Copyright © 2011-2022 走看看