Hard
You have k
bags and are given a 0-indexed integer array weights
where weights[i]
represents the weight of the iᵗʰ
marble. Your task is to divide the marbles into the k
bags following these rules:
iᵗʰ
and jᵗʰ
marbles are in a bag, then all marbles with indices between i
and j
must also be in that bag.i
to j
inclusively, its cost is calculated as weights[i] + weights[j]
.The score after distributing the marbles is the sum of the costs of all k
bags.
Objective: Return the difference between the maximum and minimum scores achievable through different valid distributions of the marbles.
Example 1:
Input:
weights = [1,3,5,1], k = 2
Output:
4
Explanation:
Input:
weights = [1, 3], k = 2
Output:
0
Explanation:
https://leetcode.com/problems/put-marbles-in-bags/description/
Loading component...
Loading component...