✅ [1161] Runtime 176 ms Beats 29.41% Memory 77.1 MB Beats 7.84%

Author: enkr1

1161/my_solution.js

@@ -12,46 +12,45 @@ class TreeNode {
  */
 const maxLevelSum = (root) => {
   let queue = [root], level = 1, max = root.val, tmpMax = 0,
-    nbOfLeaves = 0, tmpLeaves = 0, nodesToVisit = 2, visitedCount = 0;
+    nbOfLeaves = 0, tmpLeaves = 0, nodesToVisit = 2, visitedCount = 0, list = [];
 
   while (queue.length > 0) {
     let curr = queue.shift(), left = curr.left, right = curr.right;
     console.log(`> curr:${curr.val}`)
 
     if (undefined !== left) {
+      visitedCount++;
       if (null !== left) {
         tmpMax += left.val;
         queue.push(left);
-        visitedCount++;
       } else {
         tmpLeaves++;
       }
     }
 
     if (undefined !== right) {
+      visitedCount++;
       if (null !== right) {
         tmpMax += right.val;
         queue.push(right);
-        visitedCount++;
       } else {
         tmpLeaves++;
       }
     }
 
     console.log(`old_level:${level}, tmpMax:${tmpMax}, max:${max}, nodesToVisit:${nodesToVisit} visitedCount:${visitedCount}, tmpLeaves:${tmpLeaves}, nbOfLeaves:${nbOfLeaves}`)
-    // if (nodesToVisit === (visitedCount + tmpLeaves)) {
     if (nodesToVisit === (visitedCount + nbOfLeaves)) {
-      // console.log(`old_level:${level}, tmpMax:${tmpMax}, max:${max}, visitedCount:${visitedCount}, tmpLeaves:${tmpLeaves}`)
-      console.log(`>>> tmpMax:${tmpMax}, max:${max}`)
-      if (tmpMax > max) {
-        level = (nodesToVisit / 2) + 1;
+      let tmpLevel = Math.log2(nodesToVisit) + 1;
+      console.log(`>>> tmpLevel:${tmpLevel}, tmpMax:${tmpMax}, max:${max}`)
+
+      if ((null !== tmpMax) && (tmpMax > max)) {
+        level = tmpLevel;
         max = tmpMax;
       }
 
       nodesToVisit *= 2;
-      // visitedCount = nodesToVisit - (tmpLeaves * 2) - nbOfLeaves;
       visitedCount = 0;
-      tmpMax = 0;
+      tmpMax = null;
       nbOfLeaves = (nbOfLeaves + tmpLeaves) * 2;
       tmpLeaves = 0;
     }

1161/solution.js

@@ -0,0 +1,55 @@
+class TreeNode {
+  constructor(val, left, right) {
+    this.val = (val === undefined ? 0 : val);
+    this.left = (left === undefined ? null : left);
+    this.right = (right === undefined ? null : right);
+  }
+}
+
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+const maxLevelSum = (root) => {
+  let queue = [root], level = 1, max = root.val, tmpMax = 0,
+    nbOfLeaves = 0, tmpLeaves = 0, nodesToVisit = 2, visitedCount = 0;
+
+  while (queue.length > 0) {
+    let curr = queue.shift(), left = curr.left, right = curr.right;
+
+    if (undefined !== left) {
+      visitedCount++;
+      if (null !== left) {
+        tmpMax += left.val;
+        queue.push(left);
+      } else {
+        tmpLeaves++;
+      }
+    }
+
+    if (undefined !== right) {
+      visitedCount++;
+      if (null !== right) {
+        tmpMax += right.val;
+        queue.push(right);
+      } else {
+        tmpLeaves++;
+      }
+    }
+
+    if (nodesToVisit === (visitedCount + nbOfLeaves)) {
+      if ((null !== tmpMax) && (tmpMax > max)) {
+        level = Math.log2(nodesToVisit) + 1;
+        max = tmpMax;
+      }
+
+      nodesToVisit *= 2;
+      nbOfLeaves = (nbOfLeaves + tmpLeaves) * 2;
+      visitedCount = 0;
+      tmpLeaves = 0;
+      tmpMax = null;
+    }
+  }
+
+  return level;
+};

test.js

@@ -74,4 +74,13 @@
 // console.log(set.has(x))
 
 // Map
-console.log(new Map([["key", "value"], ["rrsrsr", true]]))
+// console.log(new Map([["key", "value"], ["rrsrsr", true]]))
+
+// Array
+// let l = [];
+// console.log(l)
+// l[1] = [1, 2, 3];
+// console.log(l)
+
+// Null
+console.log(null + 1);