队列的操作(初始化,入队,出队,遍历,满,空)
#include<stdio.h>
#include<malloc.h>
typedef struct Queue
{
int * pBase;
int front;
int rare;
}QUEUE,*PQUEUE;
void init(PQUEUE pQ)
{
pQ->pBase = (int*)malloc(sizeof(int)*6);
pQ->front = 0;
pQ->rare = 0;
}
bool is_full(PQUEUE pQ)
{
if((pQ->rare+1)%6 == pQ->front)
return true;
else
return false;
}
bool en_queue(PQUEUE pQ,int val)
{
if(is_full(pQ))
{
printf("队列已满!\n");
return false;
}
else
{
pQ->pBase[pQ->rare] = val;
pQ->rare = (pQ->rare + 1) % 6;
return true;
}
}
void traverse_queue(PQUEUE pQ)
{
int i = pQ->front;
while(i != pQ->rare)
{
printf("%d ",pQ->pBase[i]);
i = (i+1)%6;
}
printf("\n");
}
bool is_empty(PQUEUE pQ)
{
if(pQ->front == pQ->rare)
return true;
else
return false;
}
bool out_queue(PQUEUE pQ,int *val)
{
if(is_empty(pQ))
{
printf("队列为空!\n");
return false;
}
else
{
*val = pQ->pBase[pQ->front];
pQ->front = (pQ->front+1)%6;
return true;
}
}
int main(void)
{
int val;
QUEUE queue;
init(&queue);
en_queue(&queue,1);
en_queue(&queue,2);
en_queue(&queue,3);
en_queue(&queue,4);
en_queue(&queue,5);
en_queue(&queue,6);
en_queue(&queue,7);
traverse_queue(&queue);
out_queue(&queue,&val);
traverse_queue(&queue);
return 0;
}
队列的具体应用
所有和时间有关的操作都有队列的影子