[LeetCode] Flip Game
For example, given
s = "++++", after one move, it may become one of the following states:
The idea is quite straightforward: just traverse
s and each time when we see two consecutive
+s, convert them to
-s and add the resulting string to the final result
moves. But remember to recover the string after that.
If there is no valid move, return an empty list
Write a function to compute all possible states of the string after one valid move.
The C++ code is as follows.
You are playing the following Flip Game with your friend: Given a string that contains only these two characters:
-, you and your friend take turns to flip two consecutive
"--". The game ends when a person can no longer make a move and therefore the other person will be the winner.
Well I also try to write a Python solution since Python supports sequential comparisons, which is quite convenient. But Python does not support modifying a string and I can only use
join to do the same thing.