HTMLify

LeetCode - Divide an Array Into Subarrays With Minimum Cost I - Python
Views: 9 | Author: abh
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

Comments