#include<stdio.h>
#define MaxSize 3
typedef int ElemType;
typedef struct{
int front;
int rear;
ElemType data[MaxSize];
}Queue;
void InitQueue(Queue &Q)
{
Q.front = Q.rear = 0;
}
bool EmptyQueue(Queue Q)
{
if(Q.front == Q.rear)
return true;
else
return false;
}
bool OverflowQueue(Queue Q)
{
if((Q.rear+1)%MaxSize == Q.front)
return true;
else
return false;
}
bool EnQueue(Queue &Q,ElemType x)
{
if(OverflowQueue(Q))
return false;
Q.data[Q.rear] = x;
Q.rear = (Q.rear+1)%MaxSize;
return true;
}
bool DeQueue(Queue &Q,ElemType &x)
{
if(EmptyQueue(Q))
return false;
x = Q.data[Q.front];
Q.front = (Q.front+1)%MaxSize;
return true;
}
void main()
{
Queue Q;
InitQueue(Q);
EnQueue(Q,1);
}
循环队列-顺序存储
最新推荐文章于 2024-10-07 17:03:47 发布