Runtime: 164 ms (Top 43.73%) | Memory: 14 MB (Top 84.10%)

Author: AnasImloul

scripts/algorithms/S/Shopping Offers/Shopping Offers.py

@@ -1,3 +1,4 @@
+# Runtime: 164 ms (Top 43.73%) | Memory: 14 MB (Top 84.10%)
 class Solution:
     def shoppingOffers(self, price: List[int], special: List[List[int]], needs: List[int]) -> int:
         def dfs(price, special, needs, memo = {}):
@@ -21,4 +22,4 @@ def dfs(price, special, needs, memo = {}):
                 res.append(dfs(price, special, new_needs, memo) + offer[-1])
             memo[tuple(needs)] = min(res)
             return min(res)
-        return dfs(price, special, needs)
+        return dfs(price, special, needs)