💀 [124]

Author: enkr1

124/my_solution.js

@@ -12,58 +12,60 @@ class TreeNode {
  * @return {number}
  */
 function maxPathSum(root) {
-  let queue = [root], max = root.val;
+  let max = root.val;
 
   const exploreToFindMax = (node) => {
-    if (node === null) return;
+    if (node === null) return 0;
     console.log(`-> v:${node.val}`)
 
-    // let l = node.left, r = node.right;
-    // if (l !== null) {}
-    const defaultForNull = -Infinity;
+    let exploreLeftVal = exploreToFindMax(node.left),
+      exploreRightVal = exploreToFindMax(node.right);
+    console.log(`exploreLeftVal:${exploreLeftVal}, exploreRightVal:${exploreRightVal}`);
 
-    let treeLeftVal = 0, exploreLeftVal = defaultForNull;
-    if (node.left !== null) {
-      treeLeftVal = node.left.val;
-      // console.log("exploreToFindMax -> l")
-      exploreLeftVal = node.val + exploreToFindMax(node.left);
-    }
-    //     console.log("treeLeftVal")
-    //     console.log(treeLeftVal)
-    //     console.log("exploreLeftVal")
-    //     console.log(exploreLeftVal)
+    // 0 represents not picking any of them
+    // let treeMax = node.val + treeLeftVal + treeRightVal;
+    // let treeMax = node.val + (node.left?.val ?? 0) + (node.right?.val ?? 0);
+    let treeMax = node.val + exploreLeftVal + exploreRightVal;
 
-    let treeRightVal = 0, exploreRightVal = defaultForNull;
-    if (node.right !== null) {
-      treeRightVal = node.right.val;
-      console.log("exploreToFindMax -> r")
-      exploreRightVal = node.val + exploreToFindMax(node.right);
-      console.log("exploreRightVal")
-      console.log(exploreRightVal)
-    }
-
-    let treeMax = node.val + treeLeftVal + treeRightVal; // 0 represents not picking any of them
-
-    max = Math.max(max, treeMax, exploreLeftVal, exploreRightVal);
-    console.log("node.val")
-    console.log(node.val)
+    // max = Math.max(max, treeMax, node.val + Math.max(exploreLeftVal, exploreRightVal));
+    max = Math.max(max, treeMax);
     console.log("node.val + Math.max(exploreLeftVal, exploreRightVal, 0)")
-    console.log(node.val + Math.max(exploreLeftVal, exploreRightVal, 0))
-    return node.val + Math.max(exploreLeftVal, exploreRightVal, 0);
+    console.log(node.val + Math.max(exploreLeftVal, exploreRightVal))
+
+    return node.val + Math.max(exploreLeftVal, exploreRightVal);
+    return Math.max(node.val + Math.max(exploreLeftVal, exploreRightVal), 0);
   };
 
-  while (queue.length > 0) {
-    let curr = queue.shift(), left = curr.left, right = curr.right;
-    if (left !== null) queue.push(left);
-    if (right !== null) queue.push(right);
-    exploreToFindMax(curr);
-  }
+  exploreToFindMax(root);
 
   console.log("max")
   console.log(max)
   return max;
 }
 
+// [-1,-2,10,-6,null,-3,-6]
+// maxPathSum(
+//   new TreeNode(-1,
+//     new TreeNode(-2,
+//       new TreeNode(-6)
+//     ),
+//     new TreeNode(10,
+//       new TreeNode(-3),
+//       new TreeNode(-6)
+//     )
+//   )
+// )
+
+// maxPathSum(
+//   new TreeNode(-10,
+//     new TreeNode(9),
+//     new TreeNode(20,
+//       new TreeNode(15),
+//       new TreeNode(7)
+//     )
+//   )
+// )
+
 maxPathSum(
   new TreeNode(1,
     new TreeNode(-2),

124/solution.js

@@ -12,37 +12,21 @@ class TreeNode {
  * @return {number}
  */
 function maxPathSum(root) {
-  let queue = [root], max = root.val;
+  let max = root.val;
 
   const exploreToFindMax = (node) => {
-    if (node === null) return;
+    if (node === null) return 0;
 
-    const defaultForNull = -Infinity;
+    let exploreLeftVal = exploreToFindMax(node.left),
+      exploreRightVal = exploreToFindMax(node.right),
+      treeMax = node.val + exploreLeftVal + exploreRightVal;
 
-    let treeLeftVal = 0, exploreLeftVal = defaultForNull;
-    if (node.left !== null) {
-      treeLeftVal = node.left.val;
-      exploreLeftVal = node.val + exploreToFindMax(node.left);
-    }
+    max = Math.max(max, treeMax);
 
-    let treeRightVal = 0, exploreRightVal = defaultForNull;
-    if (node.right !== null) {
-      treeRightVal = node.right.val;
-      exploreRightVal = node.val + exploreToFindMax(node.right);
-    }
-
-    let treeMax = node.val + treeLeftVal + treeRightVal; // 0 represents not picking any of them
-
-    max = Math.max(max, treeMax, exploreLeftVal, exploreRightVal);
-    return node.val + Math.max(exploreLeftVal, exploreRightVal, 0);
+    return Math.max(node.val + Math.max(exploreLeftVal, exploreRightVal), 0);
   };
 
-  while (queue.length > 0) {
-    let curr = queue.shift(), left = curr.left, right = curr.right;
-    if (left !== null) queue.push(left);
-    if (right !== null) queue.push(right);
-    exploreToFindMax(curr);
-  }
+  exploreToFindMax(root);
 
   return max;
 }