Class Solution
-
- All Implemented Interfaces:
public final class Solution3147 - Taking Maximum Energy From the Mystic Dungeon.
Medium
In a mystic dungeon,
nmagicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.You have been cursed in such a way that after absorbing energy from magician
i, you will be instantly transported to magician(i + k). This process will be repeated until you reach the magician where(i + k)does not exist.In other words, you will choose a starting point and then teleport with
kjumps until you reach the end of the magicians' sequence, absorbing all the energy during the journey.You are given an array
energyand an integerk. Return the maximum possible energy you can gain.Example 1:
Input: energy = 5,2,-10,-5,1, k = 3
Output: 3
Explanation: We can gain a total energy of 3 by starting from magician 1 absorbing 2 + 1 = 3.
Example 2:
Input: energy = -2,-3,-1, k = 2
Output: -1
Explanation: We can gain a total energy of -1 by starting from magician 2.
Constraints:
<code>1 <= energy.length <= 10<sup>5</sup></code>
-1000 <= energy[i] <= 10001 <= k <= energy.length - 1
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegermaximumEnergy(IntArray energy, Integer k)-
-
Method Detail
-
maximumEnergy
final Integer maximumEnergy(IntArray energy, Integer k)
-
-
-
-