Class Solution
-
- All Implemented Interfaces:
public final class Solution3413 - Maximum Coins From K Consecutive Bags.
Medium
There are an infinite amount of bags on a number line, one bag for each coordinate. Some of these bags contain coins.
You are given a 2D array
coins, where <code>coinsi = l<sub>i</sub>, r<sub>i</sub>, c<sub>i</sub></code> denotes that every bag from <code>l<sub>i</sub></code> to <code>r<sub>i</sub></code> contains <code>c<sub>i</sub></code> coins.The segments that
coinscontain are non-overlapping.You are also given an integer
k.Return the maximum amount of coins you can obtain by collecting
kconsecutive bags.Example 1:
Input: coins = \[\[8,10,1],1,3,2,5,6,4], k = 4
Output: 10
Explanation:
Selecting bags at positions
[3, 4, 5, 6]gives the maximum number of coins:2 + 0 + 4 + 4 = 10.Example 2:
Input: coins = \[\[1,10,3]], k = 2
Output: 6
Explanation:
Selecting bags at positions
[1, 2]gives the maximum number of coins:3 + 3 = 6.Constraints:
<code>1 <= coins.length <= 10<sup>5</sup></code>
<code>1 <= k <= 10<sup>9</sup></code>
<code>coinsi == l<sub>i</sub>, r<sub>i</sub>, c<sub>i</sub></code>
<code>1 <= l<sub>i</sub><= r<sub>i</sub><= 10<sup>9</sup></code>
<code>1 <= c<sub>i</sub><= 1000</code>
The given segments are non-overlapping.