Leetcode 刷题 - 293 - Flip Game

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

class Solution(object):
    def generatePossibleNextMoves(self, s):
        """
        :type s: str
        :rtype: List[str]
        """
        return [(s[:i] + "--" + s[i+2:]) for i in xrange(len(s)) if s[i:i+2] == "++"]

如题意，玩游戏，一串string只有+或者-，当有两个连续的+加号的时候，可以用--两个减号代替掉。要求输出所有可能性。

很简单直接破题

result = []
for i in xrange(len(s)):
    if s[i:i+2] == "++":
        result.append(s[:i] + "--" + s[i+2:])
return result

给出一个空的list。循环遍历string可能存在的所有"++"的情况，一旦发现就仅替换成"--"，然后加入到list中，过程中并不破坏string的原始结构。最终返回。

答案可以直接了当的如最上代码块中，用Python的list comprehension来一行解决。