Leetcode: Flip Game

Question

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 [].

Hide Company Tags Google
Hide Tags String
Hide Similar Problems (M) Flip Game II

---

My Solution

Accept
Time Complexity: $O(n)$
Time: 44ms

class Solution(object):
    def generatePossibleNextMoves(self, s):
        """
        :type s: str
        :rtype: List[str]
        """

        res = []
        if len(s)<2 or (len(s)==2 and s[0]!=s[1]):
            return res

        for ind in range(len(s)-1):
            if s[ind]=="-" or s[ind+1]!=s[ind]:
                continue

            res.append( s[0:ind] + "--" + s[ind+2:] )

        return res