题解 | 吐泡泡

//算法练习No.17
//直接用 std::string 当栈用，防止输出不便和连锁爆炸缺失
#include <bits/stdc++.h>
using namespace std;

void solve()
{
    string s;
    cin >> s;//读取s到空格/换行

    string stk;//模拟Stack

    for(char c:s)
    {
        while(true)
        {
            if(stk.empty())
            {
                stk.push_back(c);
                break;
            }

            char top = stk.back();

            if(top == 'o' && c == 'o')
            {
                stk.pop_back();
                c = 'O';
            }
            else if(top == 'O' && c == 'O')
            {
                stk.pop_back();
                goto next_char;
            }
            else
            {
                stk.push_back(c);
                break;
            }
        }
        next_char:;//标签
    }   
    cout << stk << endl;

}


int main()
{
    ios::sync_with_stdio();
    cin.tie();

    int T;
    if(cin >> T)
    {
        while(T--)
            solve();
    }
    return 0;
}