forked from qintao1998/DataStruct
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.cpp
More file actions
109 lines (60 loc) · 1.6 KB
/
test.cpp
File metadata and controls
109 lines (60 loc) · 1.6 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
#include "public.h"
#ifdef TEST
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include <iostream>
using namespace std;
typedef signed char i8;
typedef unsigned char u8;
typedef unsigned long u32;
typedef unsigned short int u16;
typedef signed short int i16;
#define HI 1
#define LO 0
void get_nextval(const char *T, int next[])
{
// 求模式串T的next函数值并存入数组 next。
int j = 0, k = -1;
next[0] = -1;
//while ( T[j/*+1*/] != '\0' )
//{
// if (k == -1 || T[j] == T[k])
// {
// ++j; ++k;
// if (T[j]!=T[k])
// next[j] = k;
// else
// next[j] = next[k];
// }// if
// else
// k = next[k];
//}// while
while ( T[j/*+1*/] != '\0' )
{
if (k == -1 || T[j] == T[k])
{
++j; ++k;
if (T[j]!=T[k])
next[j] = k;
else
next[j] = next[k];
}// if
else
k = next[k];
}// while
////这里是我加的显示部分
for(int i=0;i<j;i++)
{
cout<<" "<<next[i];
}
cout<<endl;
}// get_nextval
int main(void)
{
char *p = "abcabd";
int next[7] = {0};
get_nextval(p,next);
return 0;
}
#endif