FilesExpand file tree

 main

/

0124-binary-tree-maximum-path-sum.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (29 loc) · 855 Bytes

 main

/

0124-binary-tree-maximum-path-sum.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (29 loc) · 855 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode() {}

* TreeNode(int val) { this.val = val; }

* TreeNode(int val, TreeNode left, TreeNode right) {

* this.val = val;

* this.left = left;

* this.right = right;

* }

* }

*/

class Solution {

public int maxPathSum(TreeNode root) {

int[] res = { Integer.MIN_VALUE };

maxPathSum(root, res);

return res[0];

}

public int maxPathSum(TreeNode root, int[] res) {

if (root == null) return 0;

int left = Math.max(0, maxPathSum(root.left, res));

int right = Math.max(0, maxPathSum(root.right, res));

res[0] = Math.max(res[0], root.val + left + right);

return root.val + Math.max(left, right);

}

}