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