[leetcode 293] Flip Game

Problem 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.

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 {

public:

    vector<string> generatePossibleNextMoves(string s) {

        vector<string> result;

        for (int i = 0; i < s.length() - 1; i++) {

    string s1 = s;

    if (s[i] == '+' && s[i + 1] == '+') { 

                s1[i] = s1[i + 1] = '-';

                    result.push_back(s1);

            }

        }

        return result;

    }

};