HTMLify
LeetCode - Divide an Array Into Subarrays With Minimum Cost I - Python
Views: 317 | Author: abh
1 2 3 4 5 6 7 8 | class Solution: def minimumCost(self, nums: List[int]) -> int: c = nums[0] nums = nums[1:] s = min(nums) nums.remove(s) ss = min(nums) return c + s + ss |