<p>You are given two integer arrays <code>energyDrinkA</code> and <code>energyDrinkB</code> of the same length <code>n</code> by a futuristic sports scientist. These arrays represent the energy boosts per hour provided by two different energy drinks, A and B, respectively.</p>

<p>You want to <em>maximize</em> your total energy boost by drinking one energy drink <em>per hour</em>. However, if you want to switch from consuming one energy drink to the other, you need to wait for <em>one hour</em> to cleanse your system (meaning you won&#39;t get any energy boost in that hour).</p>

<p>Return the <strong>maximum</strong> total energy boost you can gain in the next <code>n</code> hours.</p>

<p><strong>Note</strong> that you can start consuming <em>either</em> of the two energy drinks.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> energyDrinkA<span class="example-io"> = [1,3,1], </span>energyDrinkB<span class="example-io"> = [3,1,1]</span></p>

<p><strong>Output:</strong> <span class="example-io">5</span></p>

<p><strong>Explanation:</strong></p>

<p>To gain an energy boost of 5, drink only the energy drink A (or only B).</p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> energyDrinkA<span class="example-io"> = [4,1,1], </span>energyDrinkB<span class="example-io"> = [1,1,3]</span></p>

<p><strong>Output:</strong> <span class="example-io">7</span></p>

<p><strong>Explanation:</strong></p>

<p>To gain an energy boost of 7:</p>

<ul>
	<li>Drink the energy drink A for the first hour.</li>
	<li>Switch to the energy drink B and we lose the energy boost of the second hour.</li>
	<li>Gain the energy boost of the drink B in the third hour.</li>
</ul>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == energyDrinkA.length == energyDrinkB.length</code></li>
	<li><code>3 &lt;= n &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= energyDrinkA[i], energyDrinkB[i] &lt;= 10<sup>5</sup></code></li>
</ul>

'''
3259. Maximum Energy Boost From Two Drinks
URL := https://leetcode.com/problems/maximum-energy-boost-from-two-drinks/description/
Always positive integral energy

Target Complexity Analysis : 
Let N := #-hours we consume energy drinks for 
Time := O(N)
Space := O(N) ( E ) O(1) ( I ) 

15 mins but close ... you'll get it
'''
class Solution:
    def maxEnergyBoost(self, energyDrinkA: List[int], energyDrinkB: List[int]) -> int:
        energy = 0
        n = len(energyDrinkA)
        maxCons = [energyDrinkA,energyDrinkB]
        # print(maxCons)
        # n-1 and n-2 cases
        secondToLast = n-2
        drinkA = 0
        drinkB = 1
        maxCons[drinkA][secondToLast] += maxCons[drinkA][-1]
        maxCons[drinkB][secondToLast] += maxCons[drinkB][-1]
        for ptr in range(n-3,-1,-1):
            aVal = energyDrinkA[ptr]
            bVal = energyDrinkB[ptr]
            maxCons[drinkA][ptr] = max(aVal + maxCons[drinkA][ptr+1], aVal + maxCons[drinkB][ptr+2])
            maxCons[drinkB][ptr] = max(bVal + maxCons[drinkB][ptr+1], bVal + maxCons[drinkA][ptr+2])
        energy = max(maxCons[drinkA][0], maxCons[drinkB][0])
        return energy

        
40369