- 存储结构
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 3
#define ElementType int
typedef struct node
{
ElementType data[MAXSIZE];
int front;
int rear;
}Queue;
- 创建空队列
Queue* CreatQueue()
{
Queue* q=(Queue*)malloc(sizeof(node));
q->front=q->rear=MAXSIZE-1;
return q;
}
- 判空
bool IsEmpty(Queue* q)
{
if(q->front==q->rear) return true;
return false;
}
- 判满
bool IsFull(Queue* q)
{
if((q->rear+1)%MAXSIZE==q->front) return true;
return false;
}
- 入队
void InQueue(Queue* q,ElementType value)
{
if(IsFull(q)==true){
printf("队满,不能入队!\n");
return;
}else{
if(q->rear==(MAXSIZE-1)) q->rear=-1;
q->rear++;
q->data[q->rear]=value;
}
}
- 出队
ElementType OutQueue(Queue* q)
{
if(IsEmpty(q)==true){
printf("栈空!");
return 0;
}else{
if(q->front==(MAXSIZE-1)) q->front=-1;
q->front++;
return q->data[q->front];
}
}