Queue_S.h

#include<iostream>
2 using namespace std;
3 #define ElemType int
4 #define Maxlen 20
5 typedef struct 
6 {
7 ElemType q[Maxlen];
8 int front,rear;
9 }Queue;
10 //注意此队列为循环队列
11 void InitQueue(Queue &Q)//置空队列 InitQueue(Q)
12 {
13 Q.front=Q.rear=0;
14 }
15 void EnQueue(Queue &Q,ElemType &X)//入队 EnQueue(Q,x)
16 {
17 if((Q.rear+1)%Maxlen==Q.front)
18 {
19 cout<<"EnQueue error 队满\n";
20 exit(1);
21 }
22 else
23 {
24 Q.q[Q.rear]=X;
25 Q.rear=(Q.rear+1)%Maxlen;
26 }
27 }
28 void DeQueue(Queue &Q,ElemType &x)//出队 DeQueue(Q,x)
29 {
30 if(Q.rear==Q.front)
31 {
32 cout<<"DeQueue error 队空\n";
33 exit(1);
34 }
35 else
36 {
37 x=Q.q[Q.front];
38 Q.front=(Q.front+1)%Maxlen;
39 }
40 }