#include<stdio.h>
#include<stdbool.h>
#include<stdlib.h>
#define TYPE int
typedef struct QueneArray
{
TYPE* arr;
size_t len;
size_t cnt;
int head;
int tail;
}QueneArray;
//创建队列
QueueArray* create_queue_array(size_t len)
{
QueueArray* queue=malloc(sizeof(QueueArray));
queue->len=len;
queue->arr=malloc(sizeof(TYPE)len);
queue->cnt=0;
queue->head=0;
queue->tail=-1;
}
//销毁队列
void destory_queue_array(QueueArray queue)
{
free(queue->arr);
free(queue);
}
//队空
bool empty_queue_array(QueueArray* queue)
{
return !queue->cnt;
}
//队满
bool full_queue_array(QueueArray* queue)
{
return queue->cnt>=queue->len;
}
//入队
bool push_queue_array(QueueArray* queue,TYPE data)
{
if(full_queue_array(queue))
return false;
queue->tail=queue->+1%queue->len;
queue->arr[queue->tail]=data;
queue->cnt++;
return true;
}
//出队
bool pop_queue_array(QueueArray* queue)
{
if(empty_queue_array(queue))
return false;
queue->head=queue->head+1%queue->len;
queue->cnt–;
return true;
}
//队头
TYPE* head_queue_array(QueueArrayqueue)
{
if(empty_queue_array(queue)) return NULL;
return queue->arr+queue->head;
}
//队尾
TYPE tail_queue_array(QueueArray* queue)
{
if(empty_queue_array(queue)) return NULL;
return queue->arr+queeu->tail;
}
int main()
{
QueueArray* queue=create_queue_array(10);
for(int i=0;i<10;i++)
{
TYPE data=rand()%100;
printf(“push:%d %s”,data,push_queue_array(queue,data)?“yes”:“no”);
printf(“tail:%d\n”,*tail_queue_array(queue));
}
for(int i=0;i<10;i++)
{
printf(“head: %d”,*head_queue_array(queue));
printf(“pop:%s\n”,pop_queue_array(queue)?“yes”:“no”);
}
}