LeetCode 1710. Maximum Units on a Truck

Author: raul-sauco

README.md

@@ -66,6 +66,7 @@ Proposed solutions to some LeetCode problems. The first column links to the prob
 | [1658. Minimum Operations to Reduce X to Zero][lc1658]                  | Medium     | [python](leetcode/minimum-operations-to-reduce-x-to-zero.py)                  |
 | [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers][lc1689] | Medium     | [python](leetcode/partitioning-into-minimum-number-of-deci-binary-numbers.py) |
 | [1695. Maximum Erasure Value][lc1695]                                   | Medium     | [python](leetcode/maximum-erasure-value.py)                                   |
+| [1710. Maximum Units on a Truck][lc1710]                                | Easy       | [python](leetcode/maximum-units-on-a-truck.py)                                |
 | [1991. Find the Middle Index in Array][lc1991]                          | Easy       | [python](leetcode/find-the-middle-index-in-array.py)                          |
 | [2115. Find All Possible Recipes from Given Supplies][lc2115]           | Medium     | [python](leetcode/find-all-possible-recipes-from-given-supplies.py)           |
 
@@ -127,5 +128,6 @@ Proposed solutions to some LeetCode problems. The first column links to the prob
 [lc1658]: https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/
 [lc1689]: https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/
 [lc1695]: https://leetcode.com/problems/maximum-erasure-value/
+[lc1710]: https://leetcode.com/problems/maximum-units-on-a-truck/
 [lc1991]: https://leetcode.com/problems/find-the-middle-index-in-array/
 [lc2115]: https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/

leetcode/maximum-units-on-a-truck.py

@@ -0,0 +1,47 @@
+# https://leetcode.com/problems/maximum-units-on-a-truck/
+
+
+import timeit
+from typing import List
+
+# Runtime: 238 ms, faster than 50.64% of Python3 online submissions for Maximum Units on a Truck.
+# Memory Usage: 14.4 MB, less than 83.07 % of Python3 online submissions for Maximum Units on a Truck.
+
+
+class Solution:
+    def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:
+        # Sort by units per box to maximize the units of the boxes we pick
+        boxTypes.sort(key=lambda x: (x[1]), reverse=True)
+        remaining_space, units_loaded = truckSize, 0
+        for boxes_of_type, units_per_box in boxTypes:
+            # Add as many as possible of the current type
+            can_load = min(boxes_of_type, remaining_space)
+            remaining_space -= can_load
+            units_loaded += can_load * units_per_box
+            if remaining_space == 0:
+                break
+        return units_loaded
+
+
+def test():
+    executor = [
+        {'executor': Solution, 'title': 'Solution', },
+    ]
+    tests = [
+        [[[1, 3], [2, 2], [3, 1]], 4, 8],
+        [[[5, 10], [2, 5], [4, 7], [3, 9]], 10, 91],
+    ]
+    for e in executor:
+        start = timeit.default_timer()
+        for _ in range(int(float('1'))):
+            for t in tests:
+                sol = e['executor']()
+                result = sol.maximumUnits(t[0], t[1])
+                expected = t[2]
+                assert result == expected, f'{result} != {expected} for {t[0]}:{t[1]} using {e["title"]} solution'
+        used = str(round(timeit.default_timer() - start, 5))
+        result = "{0:20}{1:10}{2:10}".format(e['title'], used, "seconds")
+        print(f"\033[92m» {result}\033[0m")
+
+
+test()