LeetCode #293. Flip Game

最新推荐文章于 2022-05-16 23:32:15 发布

LawFile

最新推荐文章于 2022-05-16 23:32:15 发布

阅读量166

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/103305038

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文深入解析了一种名为FlipGame的算法挑战，玩家需将字符串中的++翻转为--，文章详细介绍了实现这一功能的具体算法，并通过示例说明了如何计算字符串所有可能的下一步状态。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：

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.

Example:

Input: s = "++++"

Output: 
[
  "--++",
  "+--+",
  "++--"
]

Note: If there is no valid move, return an empty list [].

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