https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i

2026-02-01 01:23:30 +00:00 · 2026-02-01 01:23:30 +00:00 · 308dfbad7e
commit 308dfbad7e
parent 1609c46b28
1 changed files with 7 additions and 0 deletions
--- a/easy/divide-an-array-into-subarrays-with-minimum-cost-i.py
+++ b/easy/divide-an-array-into-subarrays-with-minimum-cost-i.py
@ -0,0 +1,7 @@
+# https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i
+
+class Solution:
+    def minimumCost(self, nums: List[int]) -> int:
+        first = nums[0]
+        rest = sorted(nums[1:])
+        return first + rest[0] + rest[1]