-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathCharMatch.h
More file actions
268 lines (244 loc) · 6.17 KB
/
CharMatch.h
File metadata and controls
268 lines (244 loc) · 6.17 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
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
// Author : XuBenHao
// Version : 1.0.0
// Mail : xbh370970843@163.com
// Copyright : XuBenHao 2020 - 2030
#ifndef AILIB_ALGORITHM_CHAR_CHARMATCH_H
#define AILIB_ALGORITHM_CHAR_CHARMATCH_H
#include "..\..\stdafx.h"
#include "..\..\DataStruct\Array\DynArray.h"
namespace AlLib
{
namespace Algorithm
{
namespace Char
{
template<typename T>
class CharacterMatch
{
public:
CharacterMatch();
~CharacterMatch();
public:
DataStruct::Array::DynArray<int> RunInBasic(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_);
DataStruct::Array::DynArray<int> RunInAutoMachine(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_);
DataStruct::Array::DynArray<int> RunKMP(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_);
private:
DataStruct::Array::DynArray<int> PatternPreAnalysis(
const DataStruct::Array::DynArray<T>& arrPattern_);
};
template<typename T>
CharacterMatch<T>::CharacterMatch()
{
}
template<typename T>
CharacterMatch<T>::~CharacterMatch()
{
}
template<typename T>
DataStruct::Array::DynArray<int> CharacterMatch<T>::RunInBasic(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_)
{
// 基础&原始解法
// 对于S中的每一个位置
// 从该位置起依次将后续k个元素分别和P中对应元素一一比较，若全部相等
// 则该位置存在P。
// 否则，继续处理下一位置
int _nPatternLen = arrPattern_.GetSize();
int _nSourceLen = arrSource_.GetSize();
DataStruct::Array::DynArray<int> _arrRet;
for (int _i = 0; _i < _nSourceLen; _i++)
{
int _k = 0;
while (_k < _nPatternLen)
{
if (arrSource_[_i + _k] == arrPattern_[_k])
{
_k++;
}
else
{
break;
}
}
if (_k == _nPatternLen)
{
_arrRet.Add(_i);
}
}
return _arrRet;
}
template<typename T>
DataStruct::Array::DynArray<int> CharacterMatch<T>::RunInAutoMachine(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_)
{
int _nPatternLen = arrPattern_.GetSize();
int _nSourceLen = arrSource_.GetSize();
int _nPreMaxMatchLen = 0;
int _nCurMaxMatchLen = 0;
DataStruct::Array::DynArray<int> _arrRet;
for (int _i = 0; _i < _nSourceLen; _i++)
{
if (_nPreMaxMatchLen == _nPatternLen)
{
for (int _nCurMayMaxMatchLen = _nPreMaxMatchLen; _nCurMayMaxMatchLen >= 0; _nCurMayMaxMatchLen--)
{
bool _bSuccess = true;
int _k = 0;
while (_k < _nCurMayMaxMatchLen)
{
if (arrSource_[_i - _k] == arrPattern_[_nCurMayMaxMatchLen - 1 - _k])
{
_k++;
}
else
{
break;
}
}
if (_k == _nCurMayMaxMatchLen)
{
_bSuccess = true;
}
else
{
_bSuccess = false;
}
if (_bSuccess)
{
_nCurMaxMatchLen = _nCurMayMaxMatchLen;
break;
}
}
}
else
{
if (arrSource_[_i] == arrPattern_[_nPreMaxMatchLen])
{
_nCurMaxMatchLen = _nPreMaxMatchLen + 1;
}
else
{
for (int _nCurMayMaxMatchLen = _nPreMaxMatchLen; _nCurMayMaxMatchLen >= 0; _nCurMayMaxMatchLen--)
{
bool _bSuccess = true;
int _k = 0;
while (_k < _nCurMayMaxMatchLen)
{
if (arrSource_[_i - _k] == arrPattern_[_nCurMayMaxMatchLen - 1 - _k])
{
_k++;
}
else
{
break;
}
}
if (_k == _nCurMayMaxMatchLen)
{
_bSuccess = true;
}
else
{
_bSuccess = false;
}
if (_bSuccess)
{
_nCurMaxMatchLen = _nCurMayMaxMatchLen;
break;
}
}
}
}
if (_nCurMaxMatchLen == _nPatternLen)
{
_arrRet.Add(_i - _nPatternLen + 1);
}
_nPreMaxMatchLen = _nCurMaxMatchLen;
}
}
template<typename T>
DataStruct::Array::DynArray<int> CharacterMatch<T>::RunKMP(
const DataStruct::Array::DynArray<T>& arrPattern_,
const DataStruct::Array::DynArray<T>& arrSource_)
{
DataStruct::Array::DynArray<int> _arrRet;
DataStruct::Array::DynArray<int> _nPatternRet = PatternPreAnalysis(arrPattern_);
int _nPreMatchLen = 0;
int _nCurMatchLen = 0;
for (int _i = 0; _i < arrSource_.GetSize(); _i++)
{
if (_nPreMatchLen == arrPattern_.GetSize())
{
_nPreMatchLen = _nPatternRet[_nPreMatchLen - 1];
}
if (arrSource_[_i] == arrPattern_[_nPreMatchLen])
{
_nCurMatchLen = _nPreMatchLen + 1;
}
else
{
_nCurMatchLen = 0;
while (_nPreMatchLen > 0)
{
_nPreMatchLen = _nPatternRet[_nPreMatchLen - 1];
if (arrSource_[_i] == arrPattern_[_nPreMatchLen])
{
_nCurMatchLen = _nPreMatchLen + 1;
break;
}
}
}
_nPreMatchLen = _nCurMatchLen;
if (_nCurMatchLen == arrPattern_.GetSize())
{
_arrRet.Add(_i - arrPattern_.GetSize() + 1);
}
}
return _arrRet;
}
template<typename T>
DataStruct::Array::DynArray<int> CharacterMatch<T>::PatternPreAnalysis(
const DataStruct::Array::DynArray<T>& arrPattern_)
{
DataStruct::Array::DynArray<int> _nPatternRet;
int _nSize = arrPattern_.GetSize();
for (int _i = 0; _i < _nSize; _i++)
{
int _nNum = 0;
int _nMayNum = _i;
// 对_nNum所有可能取值：_i,...,0依次进行验证
for (; _nMayNum > 0; _nMayNum--)
{
// 需要验证 x0,...,x[MN-1] 是 x0 ... xi的后缀
int _nStartIndex = _i - _nMayNum + 1;
bool _bMatch = true;
for (int _k = 0; _k < _nMayNum; _k++)
{
if (arrPattern_[_nStartIndex + _k] != arrPattern_[_k])
{
_bMatch = false;
break;
}
}
if (_bMatch)
{
_nNum = _nMayNum;
break;
}
}
_nPatternRet.Add(_nNum);
}
return _nPatternRet;
}
}
}
}
#endif