-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkmp2.cpp
117 lines (111 loc) · 2.04 KB
/
kmp2.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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<bits/stdc++.h>
using namespace std;
void computeLPSArray(char *pat, int M, int *lps);
int KMPSearch(char *pat, char *txt)
{
int M = strlen(pat);
int N = strlen(txt);
int lps[M];
computeLPSArray(pat, M, lps);
int i = 0;
int j = 0;
while (i < N)
{
if (pat[j] == txt[i])
{
j++;
i++;
}
if (j == M)
{
return 1;
j = lps[j-1];
}
else if (i < N && pat[j] != txt[i])
{
if (j != 0)
j = lps[j-1];
else
i = i+1;
}
}
return 0;
}
int KMPcount(char *pat, char *txt)
{
int M = strlen(pat);
int N = strlen(txt);
int counter=0;
int lps[M];
computeLPSArray(pat, M, lps);
int i = 0; // index for txt[]
int j = 0; // index for pat[]
while (i < N)
{
if (pat[j] == txt[i])
{
j++;
i++;
}
if (j == M)
{
counter++;
j = lps[j-1];
}
else if (i < N && pat[j] != txt[i])
{
if (j != 0)
j = lps[j-1];
else
i = i+1;
}
}
return counter;
}
void computeLPSArray(char *pat, int M, int *lps)
{
int len = 0;
lps[0] = 0;
int i = 1;
while (i < M)
{
if (pat[i] == pat[len])
{
len++;
lps[i] = len;
i++;
}
else
{
if (len != 0)
{
len = lps[len-1];
}
else
{
lps[i] = 0;
i++;
}
}
cout<<i-1<<" "<<lps[i-1]<<endl;
}
}
int main()
{
char txt[100];
char pat[100];
cin>>pat;
int lps[strlen(pat)];
int i=0,j=strlen(pat)-1;
while(i<j)
{
swap(pat[i],pat[j]);
i++;j--;
}
cout<<pat<<endl;
computeLPSArray(pat, strlen(pat), lps);
//cin>>txt>>pat;
//cout<<KMPSearch(pat, txt)<<endl;
//cout<<KMPcount(pat, txt)<<endl;
return 0;
}