Add solution #364

Author: JoshCrozier

README.md

@@ -352,6 +352,7 @@
 361|[Bomb Enemy](./solutions/0361-bomb-enemy.js)|Medium|
 362|[Design Hit Counter](./solutions/0362-design-hit-counter.js)|Medium|
 363|[Max Sum of Rectangle No Larger Than K](./solutions/0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
+364|[Nested List Weight Sum II](./solutions/0364-nested-list-weight-sum-ii.js)|Medium|
 365|[Water and Jug Problem](./solutions/0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|
 368|[Largest Divisible Subset](./solutions/0368-largest-divisible-subset.js)|Medium|

solutions/0364-nested-list-weight-sum-ii.js

@@ -0,0 +1,47 @@
+/**
+ * 364. Nested List Weight Sum II
+ * https://leetcode.com/problems/nested-list-weight-sum-ii/
+ * Difficulty: Medium
+ *
+ * You are given a nested list of integers nestedList. Each element is either an integer or
+ * a list whose elements may also be integers or other lists.
+ *
+ * The depth of an integer is the number of lists that it is inside of. For example, the
+ * nested list [1,[2,2],[[3],2],1] has each integer's value set to its depth. Let maxDepth
+ * be the maximum depth of any integer.
+ *
+ * The weight of an integer is maxDepth - (the depth of the integer) + 1.
+ *
+ * Return the sum of each integer in nestedList multiplied by its weight.
+ */
+
+/**
+ * @param {NestedInteger[]} nestedList
+ * @return {number}
+ */
+var depthSumInverse = function(nestedList) {
+  const maxDepth = findMaxDepth(nestedList, 1);
+  return calculateSum(nestedList, 1, maxDepth);
+
+  function findMaxDepth(list, depth) {
+    let maxDepth = depth;
+    for (const element of list) {
+      if (!element.isInteger()) {
+        maxDepth = Math.max(maxDepth, findMaxDepth(element.getList(), depth + 1));
+      }
+    }
+    return maxDepth;
+  }
+
+  function calculateSum(list, depth, maxDepth) {
+    let total = 0;
+    for (const element of list) {
+      if (element.isInteger()) {
+        total += element.getInteger() * (maxDepth - depth + 1);
+      } else {
+        total += calculateSum(element.getList(), depth + 1, maxDepth);
+      }
+    }
+    return total;
+  }
+};