From 308dfbad7eed01820e84a62057f094e340e1e0ad Mon Sep 17 00:00:00 2001 From: bumpsoo Date: Sun, 1 Feb 2026 01:23:30 +0000 Subject: [PATCH] https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i --- easy/divide-an-array-into-subarrays-with-minimum-cost-i.py | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 easy/divide-an-array-into-subarrays-with-minimum-cost-i.py diff --git a/easy/divide-an-array-into-subarrays-with-minimum-cost-i.py b/easy/divide-an-array-into-subarrays-with-minimum-cost-i.py new file mode 100644 index 0000000..ae92b9a --- /dev/null +++ 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] \ No newline at end of file