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

 

這道題讓咱們把相鄰的兩個++變成--，真不是一道難題，咱們就從第二個字母開始遍歷，每次判斷當前字母是否爲+，和以前那個字母是否爲+，若是都爲加，則將翻轉後的字符串存入結果中便可，參見代碼以下：

 

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

 

相似題目：

Flip Game II

 

參考資料：

https://leetcode.com/problems/flip-game/description/

 

LeetCode All in One 題目講解彙總(持續更新中...)