-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11475 Extend to Palindrome.cpp
69 lines (62 loc) · 1.3 KB
/
11475 Extend to Palindrome.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <bits/stdc++.h>
using namespace std;
int pi[1000001];
void prefix_function (string pattern)
{
int i = 1, j = 0;
pi[j] = 0;
for (i, j; i < pattern.size(); )
{
if (pattern[i] == pattern[j])
{
pi[i] = j+1;
i++;
j++;
}
else
{
while (pattern[i] != pattern[j] && j > 0) j = pi[j-1];
if (pattern[i] != pattern[j])
{
pi[i] = 0;
i++;
}
}
}
}
int kmp (string target, string pattern) {
prefix_function (pattern);
int i = 0, j = 0;
int cnt = 0;
int c = 0;
for (i, j; i < target.size(); ) {
if (target[i] == pattern[j]) {
//cout<<target[i] << " " << pattern[j]<< endl;
i++; j++;
}
else {
while (target[i] != pattern[j] && j > 0){
j = pi[j-1];
}
if (target[i] != pattern[j]) i++;
}
}
return j;
}
int main()
{
string s,s1;
while(cin >> s)
{
s1 =s;
reverse(s1.begin(),s1.end());
int x = kmp(s,s1);
cout<<s;
for(int i = x; i < s1.size(); i++)
cout<<s1[i];
cout<< endl;
}
}