Description
给定两个字符串string1和string2,判断string2是否为string1的子串。
Input
输入包含多组数据,每组测试数据包含两行,第一行代表string1,第二行代表string2,string1和string2中保证不出现空格。(string1和string2大小不超过100字符)
Output
对于每组输入数据,若string2是string1的子串,则输出"YES",否则输出"NO"。
Sample
Input
abc a 123456 45 abc ddd
Output
YES YES NO
Hint
#define maxSize 105
#include <iostream>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
char a1[maxSize], a2[maxSize];
void getnext(char a[], int len, int next[])
{
int i = 1, j = 0;
next[1] = 0;
while(i < len)
{
if(j == 0 || a[i] == a[j])
{
i++;
j++;
next[i] = j;
}
else
{
j = next[j];
}
}
}
int kmp(char a1[], int n, char a2[], int m, int next[])
{
int i = 1, j = 1;
while(i <= n && j <= m)
{
if(j == 0 || a1[i] == a2[j])
{
i++;
j++;
}
else
{
j = next[j];
}
}
if(j > m)
return 1;
else return 0;
}
int main()
{
int next[maxSize], x;
while(scanf("%s %s", a1 + 1, a2 + 1) != EOF)
{
int l1 = strlen(a1 + 1);
int l2 = strlen(a2 + 1);
getnext(a2, l2, next);
x = kmp(a1, l1, a2, l2, next);
if(x == 1)printf("YES\n");
else printf("NO\n");
}
return 0;
}