-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkmp.c
75 lines (69 loc) · 1.34 KB
/
kmp.c
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
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
void getNext(char *p, int len, int *next)
{
int j = 0;
int q = -1;
//int len = strlen(p);
//next = (int *)malloc(sizeof(int)*len);
next[j] = q;
while (j < len-1)
{
if (q==-1 || p[q] == p[j])
{
++q;
++j;
if (p[q] != p[j])
next[j] = q;
else
next[j] = next[q];
}
else
{
q = next[q];
}
}
}
int kmp(char *p, char *s)
{
int plen = strlen(p);
int slen = strlen(s);
int n = 0;
int i = 0;
int *next = (int *)malloc(sizeof(int)*plen);
getNext(p, plen, next);
while (i < slen-1)
{
if (n==-1 || p[n] == s[i])
{
++n;
++i;
}
else
n = next[n];
if (n == plen-1)
return 1;
}
printf("%d\n", n);
return n==plen-1;
}
int main()
{
char *p = "ababaca";
char *t = "bacbababacaabcbab";
int i,j;
int len = strlen(p);
int *next = (int *)malloc(sizeof(int)*len);
getNext(p, len, next);
printf("%s\n", p);
for (i = 0; i<len; ++i)
printf("%d, ", next[i]);
printf("\n");
int r = kmp(p, t);
if (r)
printf("true\n");
else
printf("false\n");
return 0;
}