Solve : Binary Tree Maximum Path Sum

Author: printjin-gmailcom

binary-tree-maximum-path-sum/printjin-gmailcom.py

@@ -0,0 +1,12 @@
+class Solution:
+    def maxPathSum(self, root):
+        self.max_sum = float('-inf')
+        def dfs(node):
+            if not node:
+                return 0
+            left = max(dfs(node.left), 0)
+            right = max(dfs(node.right), 0)
+            self.max_sum = max(self.max_sum, node.val + left + right)
+            return node.val + max(left, right)
+        dfs(root)
+        return self.max_sum