You are playing a game that has n levels numbered from 0 to n - 1. You are given a 0-indexed integer array damage where damage[i] is the amount of health you will lose to complete the ith level. You are also given an integer armor. You may use your armor ability at most once during the game on any level, which will protect you from at most armor damage. You must complete the levels in order, and your health must be greater than 0 at all times to beat the game. Return the minimum health you need to start with to beat the game.
Constraints:
n == damage.length1 <= n <= 1050 <= damage[i] <= 1050 <= armor <= 105
https://leetcode.com/problems/minimum-health-to-beat-game/description/
Example 1:
|
1 2 3 4 5 6 7 8 |
<strong>Input:</strong> damage = [2,7,4,3], armor = 4 <strong>Output:</strong> 13 <strong>Explanation:</strong> One optimal way to beat the game starting at 13 health is: On round 1, take 2 damage. You have 13 - 2 = 11 health. On round 2, take 7 damage. You have 11 - 7 = 4 health. On round 3, use your armor to protect you from 4 damage. You have 4 - 0 = 4 health. On round 4, take 3 damage. You have 4 - 3 = 1 health. Note that 13 is the minimum health you need to start with to beat the game. |
Example 2:
|
1 2 3 4 5 6 7 8 |
<strong>Input:</strong> damage = [2,5,3,4], armor = 7 <strong>Output:</strong> 10 <strong>Explanation:</strong> One optimal way to beat the game starting at 10 health is: On round 1, take 2 damage. You have 10 - 2 = 8 health. On round 2, use your armor to protect you from 5 damage. You have 8 - 0 = 8 health. On round 3, take 3 damage. You have 8 - 3 = 5 health. On round 4, take 4 damage. You have 5 - 4 = 1 health. Note that 10 is the minimum health you need to start with to beat the game. |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
class Solution { public long minimumHealth(int[] damage, int armor) { int max = Integer.MIN_VALUE; long sum = 0; //find the maximum damage //and total sum of all the damages for(int i=0;i<damage.length;i++){ if(max < damage[i]){ max = damage[i]; } sum = sum + damage[i]; } sum = sum - max; //if maximum damage is greater than or equals to the armor then max - armor //otherwise return zero int rem = max >= armor ? max - armor:0; sum = sum + rem +1; return sum; } } |