字符串处理

 

 

 

 

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn=105;
char s[maxn],t[maxn],p[maxn];

int Find(char *a,char *b){
    int alen=strlen(a);
    int blen=strlen(b);
    int cnt=0;
    for(int i=0;i<blen;i++){
        if(b[i]==a[cnt]){
            cnt++;
        }
    }
    if(cnt==alen){
        return 1;
    }else{
        return 0;
    }
}

int Insert(char *a,char *b,char *c){
    int alen=strlen(a);
    int blen=strlen(b);
    int clen=strlen(c);
    int ans=0,cnt=0;
    int book[maxn];
    memset(book,-1,sizeof(book));
    for(int i=0;i<clen;i++){
        if(a[cnt]==c[i]){
            cnt++;
            ans++;
        }else{
            for(int j=0;j<blen;j++){
                if(c[i]==b[j]&&book[j]!=1){
                    ans++;
                    book[j]=1;
                    break;
                }
            }
        }
    }
    if(ans==clen){
        return 1;
    }else{
        return 0;
    }
}

int main(){
    int Case;
    scanf("%d",&Case);
    while(Case--){
        scanf("%s%s%s",s,t,p);
        int slen=strlen(s);
        int tlen=strlen(t);
        if(slen>tlen){
            printf("NO\n");
        }else{
            if(Find(s,t)&&Insert(s,p,t)){
                printf("YES\n");
            }else{
                printf("NO\n");
            }
        }
    }
    return 0;
} 

 

转载于:https://www.cnblogs.com/qqshiacm/p/11616100.html