Runtime: 3739 ms (Top 77.47%) | Memory: 34.10 MB (Top 46.9%)

Author: AnasImloul

scripts/algorithms/B/Burst Balloons/Burst Balloons.py

@@ -1,18 +1,11 @@
-from functools import cache
+// Runtime: 3739 ms (Top 77.47%) | Memory: 34.10 MB (Top 46.9%)
 
 class Solution:
-    def maxCoins(self, nums: List[int]) -> int:
-        nums = [1] + nums + [1]
-        length = len(nums)
-        dp = [[None]*(length+1) for i in range(length+1)]
+    def maxCoins(self, nums):
+        A = [1] + nums + [1]
 
-        @cache
-        def dfs(l,r):
-            if l>r: return 0
-            if dp[l][r] is not None: return dp[l][r]
-            dp[l][r] = 0
-            for i in range(l,r+1):
-                coins = dfs(l, i-1) + dfs(i+1, r) + nums[l-1]*nums[i]*nums[r+1]
-                dp[l][r] = max(dp[l][r], coins)
-            return dp[l][r]
-        return dfs(1, length-2)
+        @lru_cache(None)
+        def dfs(i, j):
+            return max([A[i]*A[k]*A[j] + dfs(i,k) + dfs(k,j) for k in range(i+1, j)] or [0])
+        
+        return dfs(0, len(A) - 1)