LeetCode - Flip Game

Tags: ,

You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + 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.

Write a function to compute all possible states of the string after one valid move.

For example, given s = "++++", after one move, it may become one of the following states:

If there is no valid move, return an empty list [].


We traverse the string, if there are two consecutive +s, we set them into --, and add the new string to the list.   Then we reset them back to ++ for the next step. 

Java Solution

The following up of this problem is flip game II