Remove Colored Pieces if Both Neighbors are

lcpy gen -n 2038   # by problem number
lcpy gen -s remove_colored_pieces_if_both_neighbors_are_the_same_color   # by problem name

Input: colors = "AAABABB"
Output: true
Explanation: AA<u>A</u>BABB -> AABABB
Alice moves first.
She removes the second 'A' from the left since that is the only 'A' whose neighbors are both 'A'.

Now it's Bob's turn.
Bob cannot make a move on his turn since there are no 'B's whose neighbors are both 'B'.
Thus, Alice wins, so return true.

Input: colors = "AA"
Output: false
Explanation: Alice has her turn first.
There are only two 'A's and both are on the edge of the line, so she cannot move on her turn.
Thus, Bob wins, so return false.

Input: colors = "ABBBBBBBAAA"
Output: false
Explanation: ABBBBBBBA<u>A</u>A -> ABBBBBBBAA
Alice moves first.
Her only option is to remove the second to last 'A' from the right.

ABBBB<u>B</u>BBAA -> ABBBBBBAA
Next is Bob's turn.
He has many options for which 'B' piece to remove. He can pick any.

On Alice's second turn, she has no more pieces that she can remove.
Thus, Bob wins, so return false.

class Solution:
    # Time: O(n)
    # Space: O(1)
    def winner_of_game(self, colors: str) -> bool:
        alice = 0
        bob = 0
        for i in range(1, len(colors) - 1):
            if colors[i - 1] == colors[i] == colors[i + 1]:
                if colors[i] == "A":
                    alice += 1
                else:
                    bob += 1
        return alice > bob