[LeetCode293] Flip Game

Easy

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

我觉得比lintcode那个翻硬币的简单，这道题只能把两个连续的＋翻成－，所以没有＋就不能继续游戏了。

依旧使用了c＋＋最爱的find_first_of("+")

class Solution {
public:
    vector<string> generatePossibleNextMoves(string s) {
        vector<string> res;
        if(s.empty()) return res;
        for(int i = s.find_first_of("+"); i < s.size()-1; i = s.find_first_of("+",i+1)){
            if((i+1) < s.size() && s[i+1] == '+'){
                res.push_back(s.substr(0, i) + "--" + s.substr(i+2));
            }
        }
        return res;
    }
};