FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
js-stl/src/String/string-algorithms.js at master · LukeLin/js-stl · GitHub
LukeLin
/
js-stl
Public
Notifications
You must be signed in to change notification settings
Fork
119
Star
737
Code
Issues
0
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
js-stl
/
src
/
String
/
string-algorithms.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
157 lines (127 loc) · 3.77 KB
Breadcrumbs
js-stl
/
src
/
String
/
string-algorithms.js
Copy path
File metadata and controls
157 lines (127 loc) · 3.77 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
// 求包含在串s中而t没有的字符构成的新串
function
string_Subtract
(
s
,
t
)
{
var
r
=
''
;
for
(
var
i
=
0
;
i
<
s
.
length
;
i
++
)
{
var
c
=
s
[
i
]
;
// 判断s的当前字符c是否第一次出现
for
(
var
j
=
0
;
j
<
i
&&
c
!==
s
[
j
]
;
j
++
)
;
if
(
i
===
j
)
{
// 判断当前字符是否包含在t中
for
(
var
k
=
0
;
k
<
t
.
length
&&
c
!==
t
[
k
]
;
k
++
)
;
if
(
k
>=
t
.
length
)
r
+=
c
;
}
}
return
r
;
}
string_Subtract
(
'abcde'
,
'cefgh'
)
;
// abd
// 将串s中的子串t替换为v
function
replace
(
s
,
t
,
v
)
{
var
w
=
''
;
var
n
=
0
;
var
tail
=
''
;
for
(
var
i
=
0
;
i
<=
s
.
length
-
t
.
length
;
i
++
)
{
if
(
s
.
substr
(
i
,
t
.
length
)
===
t
)
{
var
head
=
s
.
substr
(
n
,
i
-
n
)
;
tail
=
s
.
substr
(
i
+
t
.
length
,
s
.
length
-
i
-
t
.
length
+
1
)
;
w
+=
head
+
v
;
i
+=
t
.
length
;
n
=
i
;
}
}
w
+=
tail
;
return
w
;
}
console
.
log
(
replace
(
'place, ace'
,
'ace'
,
'face'
)
)
;
// plface, face
// 后缀转前缀
function
niBoLan2BoLan
(
str
)
{
var
stack
=
[
]
;
for
(
var
i
=
0
;
i
<
str
.
length
;
i
+=
1
)
{
var
r
=
str
[
i
]
;
if
(
/
\w
/
.
test
(
r
)
)
stack
.
push
(
r
)
;
else
{
if
(
!
stack
.
length
)
return
false
;
var
a
=
stack
.
pop
(
)
;
if
(
!
stack
.
length
)
return
false
;
var
b
=
stack
.
pop
(
)
;
var
c
=
r
+
b
+
a
;
stack
.
push
(
c
)
;
}
}
var
ret
=
stack
.
pop
(
)
;
return
stack
.
length
&&
ret
;
}
console
.
log
(
niBoLan2BoLan
(
'abc+*d-'
)
)
;
// -*a+bcd
function
getLongestRepeatSubStr
(
str
)
{
let
maxLen
=
0
;
let
results
=
[
]
;
for
(
let
i
=
0
;
i
<
str
.
length
;
++
i
)
{
for
(
let
j
=
0
,
k
=
0
;
j
<
str
.
length
&&
j
+
i
+
1
<
str
.
length
;
++
j
)
{
if
(
str
[
j
]
===
str
[
j
+
i
+
1
]
)
++
k
;
else
k
=
0
;
if
(
k
>
maxLen
)
{
maxLen
=
k
;
results
=
[
str
.
substring
(
j
-
k
+
1
,
j
+
1
)
]
;
}
else
if
(
maxLen
&&
k
===
maxLen
)
{
results
.
push
(
str
.
substring
(
j
-
k
+
1
,
j
+
1
)
)
;
}
}
}
return
results
;
}
console
.
log
(
getLongestRepeatSubStr
(
'abacddd'
)
)
;
console
.
log
(
getLongestRepeatSubStr
(
'ababcd'
)
)
;
console
.
log
(
getLongestRepeatSubStr
(
'abcdefghi'
)
)
;
console
.
log
(
getLongestRepeatSubStr
(
'abbccddddc'
)
)
;
console
.
log
(
getLongestRepeatSubStr
(
'abcdbcdbcb'
)
)
;
function
getLongestPublicSubstring
(
s
,
t
)
{
// a为较长的字符串，b为较短的
var
a
,
b
;
if
(
s
.
length
>=
t
.
length
)
{
a
=
s
;
b
=
t
;
}
else
{
a
=
t
;
b
=
s
;
}
var
jmin
,
jmax
,
lps1
,
lps2
;
for
(
var
maxLen
=
0
,
i
=
-
b
.
length
;
i
<
a
.
length
;
++
i
)
{
if
(
i
<
0
)
{
jmin
=
0
;
jmax
=
i
+
b
.
length
;
}
else
if
(
i
>
a
.
length
-
b
.
length
-
1
)
{
jmin
=
i
;
jmax
=
a
.
length
-
1
;
}
else
{
jmin
=
i
;
jmax
=
i
+
b
.
length
;
}
for
(
var
k
=
0
,
j
=
jmin
;
j
<=
jmax
;
++
j
)
{
if
(
a
[
j
]
===
b
[
j
-
i
]
)
++
k
;
else
k
=
0
;
if
(
k
>
maxLen
)
{
lps1
=
j
-
k
+
1
;
lps2
=
lps1
-
i
;
maxLen
=
k
;
}
}
}
if
(
maxLen
)
{
var
lpsS
,
lpsT
;
if
(
s
.
length
>=
t
.
length
)
{
lpsS
=
lps1
;
lpsT
=
lps2
;
}
else
{
lpsS
=
lps2
;
lpsT
=
lps1
;
}
console
.
log
(
'Longest Public Substring length: %d'
,
maxLen
)
;
console
.
log
(
'Position in S: %d Position in T: %d'
,
lpsS
,
lpsT
)
;
console
.
log
(
'Longest Public Substring is: %s'
,
s
.
substr
(
lpsS
,
maxLen
)
)
;
}
else
{
console
.
log
(
'No Public Substring found!'
)
;
}
}
getLongestPublicSubstring
(
'qwabcdaabcde'
,
'abcabcdeos'
)
;
getLongestPublicSubstring
(
'abbrabcd'
,
'cdababd'
)
;
// http://dsqiu.iteye.com/blog/1700312
// todo
Back
|
FazBrowse Home
|
New Git URL