HDU 2594 Simpsons’ Hidden Talents（kmp）

最新推荐文章于 2019-09-05 10:57:12 发布

原创最新推荐文章于 2019-09-05 10:57:12 发布 · 123 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

ACM刷题

kmp

本文深入探讨了KMP算法的原理与应用，通过具体案例展示了如何使用KMP算法寻找两个字符串之间的最长公共前后缀，提供了详细的代码实现，是理解和实践KMP算法的宝贵资源。

Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.
Marge: Yeah, what is it?
Homer: Take me for example. I want to find out if I have a talent in politics, OK?
Marge: OK.
Homer: So I take some politician’s name, say Clinton, and try to find the length of the longest prefix
in Clinton’s name that is a suffix in my name. That’s how close I am to being a politician like Clinton
Marge: Why on earth choose the longest prefix that is a suffix???
Homer: Well, our talents are deeply hidden within ourselves, Marge.
Marge: So how close are you?
Homer: 0!
Marge: I’m not surprised.
Homer: But you know, you must have some real math talent hidden deep in you.
Marge: How come?
Homer: Riemann and Marjorie gives 3!!!
Marge: Who the heck is Riemann?
Homer: Never mind.
Write a program that, when given strings s1 and s2, finds the longest prefix of s1 that is a suffix of s2.
Input
Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.
Output
Output consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0.
The lengths of s1 and s2 will be at most 50000.
Sample Input

clinton
homer
riemann
marjorie

Sample Output

0
rie 3

题意描述：给出两个字符串，去看第一个字符串的后缀与第二个串的前缀是否有相同的，如果有就输出，相同的部分和长度，如果没有就输出0.

解题方法：用一个kmp中的next数组去标记第二个字符串，然后去遍历第一个字符串和第二个字符串是否有匹配的，当第一个字符串遍历完成时记录j的值，表示此时第二个字符串所遍历到的位置就可以了。

AC代码：

#include<stdio.h>
#include<string.h>

int ls,ls1;
char s[50100],s1[50100];
int ans,k;
int next[50100];

void get_next()
{
	int i=0,j=1;
	while(j<ls)
	{
		if(i==0&&s[i]!=s[j])
			next[j++]=0;
		else if(i>0&&s[i]!=s[j])
			i=next[i-1];
		else
		{
			next[j]=i+1;
			i++;
			j++;
		}
	}
}

void kmp()
{
	int i=0,j=0,d=1;
	int flag=0;
	while(i<ls1)
	{
		if(j==0&&s1[i]!=s[j])
			i++;
		else if(j>0&&s1[i]!=s[j])
			j=next[j-1];
		else
		{
			i++;
			j++;
		}
		if(i==ls1)
             ans=j;
	}
}

int main()
{
	while(scanf("%s%s",s,s1)!=EOF)
	{
		ls=strlen(s);
		ls1=strlen(s1);
		ans=0;
		k=0;
		get_next();
		kmp();
		if(ans==0)
			printf("0\n");
		else
		{
			for(int i=0;i<ans;i++)
				printf("%c",s[i]);
			printf(" %d\n",ans);
		}
	}
	return 0;
}