LeetCode Q293: 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 [].

Solution:

	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]&&s[i]=='+'){
	string tmp = s;
	tmp[i] = tmp[i]=='+'? '-':'+';
	tmp[i+1] = tmp[i];
	res.push_back(tmp);
	}
	}
	return res;
	}
	};

view raw Q293.cpp hosted with ❤ by GitHub