-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathKMP.cpp
More file actions
118 lines (108 loc) · 1.85 KB
/
Copy pathKMP.cpp
File metadata and controls
118 lines (108 loc) · 1.85 KB
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
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>
using namespace std;
using namespace __gnu_cxx;
#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)
void preprocess(int arr[], int m, char pat[])
{
arr[0] = 0;
int len = 0;
int i = 1;
while(i<m)
{
if(pat[i]==pat[len])
{
len++;
arr[i]=len;
i++;
}else
{
if(len!=0)
{
len = arr[len-1];
} else
{
len = 0;
i++;
}
}
}
// for(int i=0;i<m;i++)
// cout<<i<<" "<<arr[i]<<endl;
}
void KMP(char text[], char pat[], int n, int m)
{
// printf("%s\n", pat);
int arr[m];
preprocess(arr, m, pat);
int i=0, j=0;
while(i<n)
{
// cout<<i<<" "<<j<<endl;
if(text[i] == pat[j])
{
i++;
j++;
}
if(j==m)
{
cout<<"found pattern at \t" << i-j<<endl;
j = arr[j-1];
} else if(text[i] != pat[j])
{
if(j != 0)
j = arr[j-1];
else
i = i+1;
}
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
char text[100]="ABABDABACDABABCABAB", pat[20]="ABABCABAB";
//scanf("%s %s", text, pat);
KMP(text, pat, strlen(text), strlen(pat));
system("pause");
}