-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathquestion57.c
85 lines (69 loc) · 1.13 KB
/
question57.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
76
77
78
79
80
81
82
83
84
85
/*
http://practice.geeksforgeeks.org/problems/search-pattern/0
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void makeRef(int *ref, char *pattern, int length){
int i=1,len=0;
ref[0] = 0;
while(i < length) {
if(pattern[i] == pattern[len]){
len++;
ref[i] = len;
i++;
}else{
if(len == 0){
i++;
}else{
len = ref[len-1];
}
}
}
}
void searchString(char *text, char *pattern){
int tlen = strlen(text);
int plen = strlen(pattern);
int ref[plen];
int i;
for(i=0;i<plen;i++){
ref[i] = 0;
}
makeRef(ref,pattern, plen);
int j=0; i=0;
int noPattern = 1;
while(i < tlen) {
if(text[i] == pattern[j]) {
i++;
j++;
}
if(j==plen) {
noPattern = 0;
printf("%d ", i-j + 1);
j = ref[j-1];
}
else if(i < tlen && text[i] != pattern[j]) {
if(j!=0) {
j = ref[j-1];
}else{
i++;
}
}
}
printf("\n");
if(j < plen && noPattern != 0) {
printf("%d\n", -1);
}
}
int main(){
int cases;
scanf("%d",&cases);
int i;
for(i=0;i<cases;i++) {
char text[11000], pattern[11000];
scanf("%s",text);
scanf("%s",pattern);
searchString(text, pattern);
}
return 0;
}