Leetcode NO.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 twoconsecutive "++" 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 [].

是一道新出的easy题。。不多说了，还是很简单的，直接上代码：

class Solution {
public:
    vector<string> generatePossibleNextMoves(string s) {
        vector<string> res;
        if (s.length() <= 1) {
            return res;
        }
        for (int i = 0; i < s.length() - 1; ++i) {
            if (s[i] == s[i+1] and s[i] == '+') {
                s[i] = s[i+1] = '-';
                res.push_back(s);
                s[i] = s[i+1] = '+';
            }
        }
        return res;
    }
};