题解 | 小红的01串

#include <bits/stdc++.h>
using namespace std;

void solve()
{
    string s;
    cin>>s;
    int n = s.size();
    string s2 = s;
    for(int i=0;i<n;i++)
    {
        if(s[i] =='1')
        {
            if(i+1<n)s[i] = '0';
            if(i+1<n&&s[i+1]=='0')s[i+1]='1';
            else if(i+1<n&&s[i+1]=='1')s[i+1]='0';
        }
    }
    int cnt = 0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='0')cnt++;
    }
    if(cnt==n)
    {
        cout<<"Yes\n";
        return ;
    }

    s2 = s ;
    for(int i=0;i<n;i++)
    {
        if(s[i] =='0')
        {
            if(i+1<n)s[i] = '1';
            if(i+1<n&&s[i+1]=='0')s[i+1]='1';
            else if(i+1<n&&s[i+1]=='1')s[i+1]='0';
        }
    }
    cnt = 0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='1')cnt++;
    }
    
    if(cnt==n)
    {
        cout<<"Yes\n";
    }
    else cout<<"No\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

判断能够让结果为全0或者结果为全1的情况即可