题目:
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 marjorieSample Output
0 rie 3
题目大意:
求解字符串A的前缀 和 字符串B的后缀相同的最长长度。
解题思路:
连一块用next[len]一找就是最长相同的前后缀大小,然后WA了,因为如果 A 是asas,B 是as,则答案应该是2,但是实际上会得到4,很懵*的感觉,然后就想到,在两个字符串之间加上一个无论如何都不会出现的字符 ‘ ! ’,然后用next [len] 找最长相同的前后缀,完美AC嘿嘿~
实现代码:
#include<cstdio>
#include<fstream>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<string.h>
#include<queue>
#include<vector>
#include<map>
using namespace std;
string s1,s2,s;
int Next[1000005];
void getnext(string ss,int d){
int k=-1; Next[0]=-1;
for(int i=1;i<d;i++){
while(k>-1&&ss[k+1]!=ss[i]){
k=Next[k];
}
if(ss[k+1]==ss[i]) k++;
Next[i]=k;
}
}
int main(){
ios::sync_with_stdio(false); //加速
cin.tie(0);
while(cin>>s1>>s2){
s="";
s+=s1;s+='!';s+=s2;
int lm=s.length();
getnext(s,lm);
if(Next[lm-1]==-1) cout<<"0"<<endl;
else cout<<s.substr(0,Next[lm-1]+1)<<" "<<Next[lm-1]+1<<endl;
}
return 0;
}