293. Flip Game

最新推荐文章于 2023-08-06 21:52:36 发布

BigFatSheep

最新推荐文章于 2023-08-06 21:52:36 发布

阅读量231

点赞数

分类专栏： Leetcode Easy

本文链接：https://blog.youkuaiyun.com/BigFatSheep/article/details/79457435

版权

Leetcode 同时被 2 个专栏收录

385 篇文章

订阅专栏

Easy

142 篇文章

订阅专栏

问题描述

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

题目链接：

思路分析

给一串由“++++—-”组成的字符串，可以将其中的一对连续的“++”变为“–”，返回变换一次之后的所有可能。

可能是因为很久之前的题目了，热度很低，也很简单。保持一个s的副本，从头遍历，可以变就入向量。

代码

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