binary-tree-maximum-path-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

The path sum of a path is the sum of the node&#39;s values in the path.

Given the <code>root</code> of a binary tree, return the maximum path sum of any non-empty path.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" />
<pre>
Input: root = [1,2,3]
Output: 6
Explanation: The optimal path is 2 -&gt; 1 -&gt; 3 with a path sum of 2 + 1 + 3 = 6.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" />
<pre>
Input: root = [-10,9,20,null,null,15,7]
Output: 42
Explanation: The optimal path is 15 -&gt; 20 -&gt; 7 with a path sum of 15 + 20 + 7 = 42.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 3 * 104]</code>.</li>
	<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>
</ul>

maxPathSum

Binary Tree Maximum Path Sum

Path Sum

path-sum

路径总和

Sum Root to Leaf Numbers

sum-root-to-leaf-numbers

求根节点到叶节点数字之和

Path Sum IV

path-sum-iv

路径总和 IV

Longest Univalue Path

longest-univalue-path

最长同值路径

Time Needed to Inform All Employees

time-needed-to-inform-all-employees

通知所有员工所需的时间

Difference Between Maximum and Minimum Price Sum

difference-between-maximum-and-minimum-price-sum

最大价值和与最小价值和的差值

Tree

Depth-First Search

Dynamic Programming

Binary Tree

二叉树中的 路径 被定义为一条节点序列，序列中每对相邻节点之间都存在一条边。同一个节点在一条路径序列中 至多出现一次 。该路径 至少包含一个 节点，且不一定经过根节点。

路径和 是路径中各节点值的总和。

给你一个二叉树的根节点 <code>root</code> ，返回其 最大路径和 。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" />
<pre>
输入：root = [1,2,3]
输出：6
解释：最优路径是 2 -&gt; 1 -&gt; 3 ，路径和为 2 + 1 + 3 = 6</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" />
<pre>
输入：root = [-10,9,20,null,null,15,7]
输出：42
解释：最优路径是 15 -&gt; 20 -&gt; 7 ，路径和为 15 + 20 + 7 = 42
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数目范围是 <code>[1, 3 * 104]</code></li>
	<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>
</ul>