914. Flip Game
Description:
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.
Example
Given s = “++++”, after one move, it may become one of the following states:
[
“–++”,
“+–+”,
“++–”
]
If there is no valid move, return an empty list [].
Code:
class Solution:
"""
@param s: the given string
@return: all the possible states of the string after one valid move
"""
def generatePossibleNextMoves(self, s):
# write your code here
res = []
for i in range(1,len(s)):
if s[i] == s[i-1] == '+':
res.append(s[:i-1]+'--'+s[i+1:])
return res