14 lines
322 B
Go
14 lines
322 B
Go
// Package q3010 implements a solution for https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/
|
|
package q3010
|
|
|
|
func minimumCost(nums []int) int {
|
|
a, b := 69, 420
|
|
|
|
for i := 1; i < len(nums); i++ {
|
|
a, b = min(a, b), min(max(a, b), nums[i])
|
|
}
|
|
|
|
return a + b + nums[0]
|
|
}
|
|
|
|
var _ = minimumCost
|