Flip Game

Problem

You are playing a Flip Game with your friend.

You are given a string currentState that contains only '+' and '-'. You and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longer make a move, and therefore the other person will be the winner.

Return all possible states of the string currentState after one valid move. You may return the answer in any order. If there is no valid move, return an empty list [].

Constraints

• 1 <= currentState.length <= 500
• currentState[i] is either '+' or '-'.

Solution

The problem Flip Game can be solved by simply iterating through the string to find two consecutive "++" and converting them into "--".

Implementation

class Solution
{
  public:
    vector<string> generatePossibleNextMoves(string currentState)
    {
        vector<string> ret;
        for (int i = 0; i < currentState.length() - 1; i++)
            if (currentState[i] == '+' && currentState[i + 1] == '+')
            {
                currentState[i] = currentState[i + 1] = '-';
                ret.push_back(currentState);
                currentState[i] = currentState[i + 1] = '+';
            }

        return ret;
    }
};