-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
85 lines (68 loc) · 2.06 KB
/
index.js
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
/*
* @Author: kerim selmi
* @Date: 2018-06-12 12:05:03
* @Last Modified by: kerim selmi
* @Last Modified time: 2018-06-12 16:36:28
*/
/**
* A JavaScript program that implements Z algorithm for pattern searching
*/
//Fills Z array for given string str[]
const getZarr = (str, Z) => {
const n = str.length;
// [L,R] make a window which matches with
// prefix of s
let L = 0, R = 0
for (let i = 1; i < n; ++i) {
// if i>R nothing matches so we will calculate.
// Z[i] using naive way.
if (i > R) {
L = R = i
// R-L = 0 in starting, so it will start
// checking from 0'th index
while (R < n && str.charAt(R - L) == str.charAt(R))
R++
Z[i] = R - L
R--
}
else {
// k = i-L so k corresponds to number which
// matches in [L,R] interval.
const k = i - L
// if Z[k] is less than remaining interval
// then Z[i] will be equal to Z[k].
if (Z[k] < R - i + 1)
Z[i] = Z[k]
else {
// else start from R and check manually
L = i
while (R < n && str.charAt(R - L) == str.charAt(R))
R++
Z[i] = R - L
R--
}
}
}
}
// prints all occurrences of pattern in text using Z algo
const search = (text, pattern) => {
// Create concatenated string "P$T"
const concat = pattern + "$" + text
const l = concat.length
let Z = []
let result = []
// Construct Z array
getZarr(concat, Z);
// now looping through Z array for matching condition
for (let i = 0; i < l; ++i) {
// if Z[i] (matched region) is equal to pattern
// length we got the pattern
//console.log(Z[i]+" "+pattern.length)
if (Z[i] == pattern.length) {
result.push((i - pattern.length - 1))
}
}
return result
}
//console.log(search('aaafqf', 'a'))
exports.search = search;