DAY62

swolecoder · swolecoder · commit 975c896b6a32 · 2020-12-13T14:52:49.000-05:00
diff --git a/Day62/index.js b/Day62/index.js
@@ -0,0 +1,34 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxCoins = function (nums) {
+    let N = nums.length;
+    if (N == 0) return 0;
+
+    let opt = new Array(N).fill(0).map(() => new Array(N).fill(0));
+
+    for (let len = 0; len < N; len++) {
+
+        for (let i = 0; i + len < N; i++) {
+            let j = i + len;
+
+            for (let k = i; k <= j; k++) {
+
+                let left_num = i === 0 ? 1 : nums[i - 1];
+                let right_num = j === N - 1 ? 1 : nums[j + 1];
+
+                let left_opt = k == i ? 0 : opt[i][k - 1];
+                let right_opt = k == j ? 0 : opt[k + 1][j]
+
+                opt[i][j] = Math.max(
+                    opt[i][j],
+                    left_num * nums[k] * right_num + left_opt + right_opt
+
+                )
+
+            }
+        }
+    }
+    return opt[0][N - 1]
+};
diff --git a/README.md b/README.md
@@ -139,4 +139,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 60| [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|Medium|
 
-|Day 61| [865. Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | [javascript]()|[:memo:](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/)|Medium|
+|Day 61| [865. Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | [javascript]()|[:memo:](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/)|Medium|
+
+|Day 62| [312. Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [javascript]()|[:memo:](https://leetcode.com/problems/burst-balloons/)|Hard|
