[LeetCode] Flip Game

293. Flip Game

You are playing a Flip Game with your friend.

You are given a string currentState that contains only '+' 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.

Return all possible states of the string currentState after one valid move. You may return the answer in any order. If there is no valid move, return an empty list [].

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
vector<string> generatePossibleNextMoves(string s) {
vector<string> res;
for(int i = 0; i < s.size() - 1; i++) {
if(s[i] == '+' and s[i+1] == '+') {
string ss = s;
ss[i] = ss[i+1] = '-';
res.push_back(ss);
}
}
return res;
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2024/02/01/PS/LeetCode/flip-game/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.