#include
#include
#include
#include
#define MAXSIZE 10
typedef struct
{
int num;//数据成员// int *base;//基地址// int front; int rear; int s;
}SeQueue;
int InitQueue(SeQueue &Q)//构造空列表// {
} Q.base=(int*)malloc(MAXSIZE*sizeof(int)); if(!Q.base) exit (1); Q.front=0; Q.rear=0; return 1;
int QueueEmpty(SeQueue Q)//判队空// {
if(Q.rear==Q.front)
return 1;
else return 0;
}
void EnQueue(SeQueue &Q,int e)//入队// {
if(Q.front==(Q.rear+1)%MAXSIZE) cout
}
int DeQueue(SeQueue &Q)//出队//
{
int e; if(Q.front=Q.rear) return 0; Q.front=Q.front+1;
} if(Q.front==Q.num+1) Q.front=1; e=Q.base[Q.front-1]; if(Q.front==Q.rear) Q.s=0; return e;
void print_SeQueue(SeQueue &Q)
{
int i; cout
}
int main()
{
int i;
SeQueue S; i=InitQueue(S);
cout
EnQueue(S,2);
EnQueue(S,3);
EnQueue(S,4);
EnQueue(S,5);
print_SeQueue(S);
cout
} cout
#include
#include
#include
#include
#define MAXSIZE 10
typedef struct
{
int num;//数据成员// int *base;//基地址// int front; int rear; int s;
}SeQueue;
int InitQueue(SeQueue &Q)//构造空列表// {
} Q.base=(int*)malloc(MAXSIZE*sizeof(int)); if(!Q.base) exit (1); Q.front=0; Q.rear=0; return 1;
int QueueEmpty(SeQueue Q)//判队空// {
if(Q.rear==Q.front)
return 1;
else return 0;
}
void EnQueue(SeQueue &Q,int e)//入队// {
if(Q.front==(Q.rear+1)%MAXSIZE) cout
}
int DeQueue(SeQueue &Q)//出队//
{
int e; if(Q.front=Q.rear) return 0; Q.front=Q.front+1;
} if(Q.front==Q.num+1) Q.front=1; e=Q.base[Q.front-1]; if(Q.front==Q.rear) Q.s=0; return e;
void print_SeQueue(SeQueue &Q)
{
int i; cout
}
int main()
{
int i;
SeQueue S; i=InitQueue(S);
cout
EnQueue(S,2);
EnQueue(S,3);
EnQueue(S,4);
EnQueue(S,5);
print_SeQueue(S);
cout
} cout