Runtime: 760 ms (Top 68.15%) | Memory: 14.5 MB (Top 56.05%)

Author: AnasImloul

scripts/algorithms/T/Tallest Billboard/Tallest Billboard.py

@@ -1,3 +1,4 @@
+# Runtime: 760 ms (Top 68.15%) | Memory: 14.5 MB (Top 56.05%)
 
 class Solution:
     def tallestBillboard(self, rods: List[int]) -> int:
@@ -6,15 +7,15 @@ def tallestBillboard(self, rods: List[int]) -> int:
         for x in rods:
             nxt = dp.copy()
             for d, y in dp.items():
-                # init state 
-                # ------|----- d -----|      # tall side 
-                # - y --|                    # low  side
+                # init state
+                # ------|----- d -----| # tall side
+                # - y --| # low side
 
-                # put x to tall side 
+                # put x to tall side
                 # ------|----- d -----|---- x --|
                 # - y --|
                 nxt[d + x] = max(nxt.get(x + d, 0), y)
-               
+
                 nxt[abs(d - x)] = max(nxt.get(abs(d - x), 0), y + min(d, x))
             dp = nxt
-        return dp[0]
+        return dp[0]