Codeforce 1104B 字符串思维题 类回文（栈）

Game with string
TimeLimit:1000MS MemoryLimit:256MB
64-bit integer IO format:%I64d
已解决 | 点击收藏
Problem Description
Two people are playing a game with a string s, consisting of lowercase latin letters.

On a player’s turn, he should choose two consecutive equal letters in the string and delete them.

For example, if the string is equal to “xaax” than there is only one possible turn: delete “aa”, so the string will become “xx”. A player not able to make a turn loses.

Your task is to determine which player will win if both play optimally.

Input
The only line contains the string s, consisting of lowercase latin letters (1 ≤ |s| ≤ 100 000), where |s| means the length of a string s.

Output
If the first player wins, print “Yes”. If the second player wins, print “No”.

SampleInput 1
abacaba
SampleOutput 1
No
SampleInput 2
iiq
SampleOutput 2
Yes
SampleInput 3
abba
SampleOutput 3
No

Note

In the first example the first player is unable to make a turn, so he loses.

In the second example first player turns the string into “q”, then second player is unable to move, so he loses.

题意：两人轮流消去字符串中的两个相邻的相同字符，字符删去后其他字符后自动连接 即 axxa 删去xx后变成 aa 哪一方无法操作哪一方就输
思路：一般这种类回文的题目可以想到用栈来解

#include <iostream>
#include <stack>

using namespace std;

int main()
{
    string s;

    cin >> s;

    stack<char>st;

    int cnt=0;

    for(int i=0;i<s.length();i++)
    {
        if(!st.empty()&&s[i]==st.top())///相同就弹出
        {
            cnt++;
            st.pop();
        }
        else
            st.push(s[i]);
    }

    if(cnt%2==0)
        cout << "No" << endl;
    else
        cout << "Yes" <<endl;

    return 0;
}