队列的基本操作:初始化、入队、出队、遍历输出、判断是否为空、判断是否满队
# include<stdio.h>
# include<malloc.h>
typedef struct Queue
{
int * pBase;
int front;
int rare;
}QUEUE;
void init(QUEUE *);
bool full_Queue(QUEUE *);
void enput(QUEUE *, int);
void traverse(QUEUE *);
bool out_Queue(QUEUE *, int * );
int main(void)
{
QUEUE Q;
int val;
init(&Q);
enput(&Q, 1);
enput(&Q, 2);
enput(&Q, 3);
enput(&Q, 4);
enput(&Q, 5);
enput(&Q, 6);
traverse(&Q);
if(out_Queue(&Q, &val))
printf("出队成功!,出队的元素为:%d\n", val);
traverse(&Q);
return 0;
}
void init(QUEUE * pQ)
{
pQ->pBase = (int *)malloc(sizeof(int) * 7);
pQ->front = 0;
pQ->rare = 0;
return;
}
bool full_Queue(QUEUE * pQ)
{
if((pQ->rare + 1) % 7 == pQ->front)
return true;
else
return false;
}
bool empty_Queue(QUEUE * pQ)
{
if(pQ->front == pQ->rare)
return true;
else
return false;
}
void enput(QUEUE * pQ, int val)
{
if (full_Queue(pQ))
{
printf("队列已满!\n");
return ;
}
else
{
pQ->pBase[pQ->rare] = val;
pQ->rare = (pQ->rare + 1) % 7;
return ;
}
}
void traverse(QUEUE * pQ)
{
int i = pQ->front;
while(i != pQ->rare)
{
printf("%d ", pQ->pBase[i]);
i = (i + 1) % 7;
}
printf("\n");
return;
}
bool out_Queue(QUEUE * pQ, int * pVal)
{
if(empty_Queue(pQ))
{
printf("队列为空!,出队失败!\n");
return false;
}
else
{
*pVal = pQ->pBase[pQ->front];
pQ->front = (pQ->front + 1) % 7;
return true;
}
}