Approach 1: Greedy
If we play a token face up, we might as well play the one with the smallest value. Similarly, if we play a token face down, we might as well play the one with the largest value.
We don't need to play anything until absolutely necessary. Let's play tokens face up until we can't, then play a token face down and continue.
We must be careful, as it is easy for our implementation to be incorrect if we do not handle corner cases correctly. We should always play tokens face up until exhaustion, then play one token face down and continue.
Our loop must be constructed with the right termination condition: we can either play a token face up or face down.
Our final answer could be any of the intermediate answers we got after playing tokens face up (but before playing them face down.)
Time Complexity: , where is the length of
Space Complexity: .
Analysis written by: @awice.