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
| #include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MaxSize 10
typedef struct {
int data[MaxSize];
int top;
} SqStack;
void InitStack(SqStack& S) {
S.top = -1;
}
void testStack() {
SqStack S;
InitStack(S);
}
bool StackEmpty(SqStack S) {
if (S.top == -1)
return true;
else
return false;
}
bool Push(SqStack& S, int x) {
if (S.top == MaxSize - 1) {
return false;
}
S.top += 1;
S.data[S.top] = x;
return true;
}
bool Pop(SqStack& S, int& x) {
if (S.top == -1) {
return false;
}
x = S.data[S.top];
S.top -= 1;
return true;
}
bool GetTop(SqStack S, int& x) {
if (S.top == -1) {
return false;
}
x = S.data[S.top];
return true;
}
typedef struct Linknode {
int data;
struct Linknode* next;
}* LiStack;
#define MaxSize 10
typedef struct {
int data[MaxSize];
int front, rear;
} SqQueue;
void testQueue() {
SqQueue Q;
InitQueue(Q);
}
void InitQueue(SqQueue& Q) {
Q.rear = Q.front = 0;
}
bool QueueEmpty(SqQueue Q) {
if (Q.rear == Q.front) {
return true;
} else {
return false;
}
}
bool Enqueue(SqQueue& Q, int x) {
if ((Q.rear + 1) % MaxSize == Q.front) {
return false;
}
Q.data[Q.rear] = x;
Q.rear = (Q.rear + 1) % MaxSize;
return true;
}
bool DeQueue(SqQueue& Q, int& x) {
if (Q.rear == Q.front) {
return false;
}
x = Q.data[Q.front];
Q.front = (Q.front + 1) % MaxSize;
return true;
}
bool GetHead(SqQueue Q, int& x) {
if (Q.rear == Q.front) {
return false;
}
x = Q.data[Q.front];
return true;
}
typedef struct Linknode {
int data;
struct Linknode* next;
}* LinkNode;
typedef struct {
LinkNode *front, *rear;
} LinkQueue;
void InitQueue(LinkQueue& Q) {
Q.front = Q.rear = (LinkNode*)malloc(sizeof(LinkNode));
Q.front->next = NULL;
}
void testLinkQueue() {
LinkQueue Q;
InitQueue(Q);
}
bool IsEmpty(LinkQueue Q) {
if (Q.front == Q.rear) {
return true;
} else {
return false;
}
}
bool IsEmpty(LinkQueue Q) {
if (Q.front == NULL) {
return true;
} else {
return false;
}
}
void EnQueue(LinkQueue& Q, int x) {
LinkNode* s = (LinkNode*)malloc(sizeof(LinkNode));
s->data = x;
s->next = NULL;
Q.rear->next = s;
Q.rear = s;
}
void EnQueue(LinkQueue& Q, int x) {
LinkNode* s = (LinkNode*)malloc(sizeof(LinkNode));
s->data = x;
s->next = NULL;
if (Q.front == NULL) {
Q.front = s;
Q.rear = s;
} else {
Q.rear->next = s;
Q.rear = s;
}
}
bool DeQueue(LinkQueue& Q, int& x) {
if (Q.front == Q.rear) {
return false;
}
LinkNode* p = Q.front->next;
if (Q.rear == p) {
Q.rear = Q.front;
}
free(p);
return true;
}
bool DeQueue(LinkQueue& Q, int& x) {
if (Q.front == NULL) {
return false;
}
LinkNode* p = Q.front x = p->data;
Q.front = p->next;
if (Q.rear == p) {
Q.rear = NULL;
Q.front = NULL;
}
free(p);
return true;
}
|
