wenbao与字符串处理

弱鸡代码

#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main()
{
    std::ios::sync_with_stdio(false);
    int n,i,j;
    string str1,str3,str2;
    cin>>str1;
    cin>>str2;
    int len = str1.length();
    for( i=0; i<len; i++)
    {
        if(str1[i]=='[')
        {
            n=0;
            for( j=i+1;; j++)
            {
                if(str1[j]==']')
                {
                    for(int t=0; t<n-1; t++)
                        str3+=str1[i-1];
                    break;
                }
                else
                n=n*10+str1[j]-'0';
            }
            i=j;
        }
        else
            str3+=str1[i];
    }
    string::size_type it;
    it=str3.find(str2);
    if(it!=string::npos)
        cout<<"True"<<endl;
    else
        cout<<"False"<<endl;
    return 0;
}

大神代码

#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <cstdlib>  
#include<iostream>  
using namespace std;  
#define N 1005  
typedef long long ll;  
struct C{  
    int cnt;  
    char ch;  
};  
C A[N], B[N];  
int main()  
{  
    while (1)  
    {  
        for (int i = 0; i < N; i++)  
        {  
            A[i].cnt = 1;  
        }  
        char temp, t = ' ';  
        int cnt1 = -1, cnt2 = -1;  
        while (scanf("%c", &temp), temp != '
')  
        {  
            if (t == temp) A[cnt1].cnt++;  
            else if (temp != '[' && t != temp)  
            {  
                cnt1++;  
            }  
  
            if (temp >= 'a' && temp <= 'z')  
            {  
                A[cnt1].ch = temp;  
                t = temp;  
            }  
            if (temp == '[')  
            {  
                int num;  
                scanf("%d%*c", &num);  
                A[cnt1].cnt = num;  
            }  
        }  
        t = ' ';  
        while (scanf("%c", &temp), temp != '
')  
        {  
            if (temp >= 'a' && temp <= 'z' && temp != t)  
            {  
                B[++cnt2].ch = temp;  
                B[cnt2].cnt = 1;  
                t = temp;  
            }  
            else if (temp == t)  
            {  
                B[cnt2].cnt++;  
            }  
        }  
    /* 
    for(int i=0;i<=cnt1;i++) 
    cout<<A[i].ch<<" "; 
    cout<<endl; 
    for(int i=0;i<=cnt1;i++) 
        cout<<A[i].cnt<<" "; 
    cout<<endl; 
    for(int i=0;i<=cnt2;i++) 
        cout<<B[i].ch<<" "; 
    cout<<endl; 
    for(int i=0;i<=cnt2;i++) 
        cout<<B[i].cnt<<" "; 
    cout<<endl; 
    */  
        int flag = 0;  
        for (int i = 0; i <= cnt1; i++)  
        {  
            if (A[i].ch == B[0].ch && A[i].cnt >= B[0].cnt)  
            {  
                int flag2 = 1;  
                for (int j = 1; j < cnt2; j++)  
                {  
                    if (A[i + j].ch != B[j].ch || A[i + j].cnt != B[j].cnt)  
                    {  
                        flag2 = 0;  
                        break;  
                    }  
                }  
                if (flag2)  
                {  
                    if (A[i + cnt2].ch == B[cnt2].ch && A[i + cnt2].cnt >= B[cnt2].cnt)  
                    {  
                        flag = 1;  
                        break;  
                    }  
                }  
            }  
        }  
        if (cnt1 == -1 && cnt2 == -1) break;  
        if (flag) printf("True
");  
        else printf("False
");  
    }  
    return 0;  
}  

只有不断学习才能进步！