队列的基础实现C

数组顺环

#include<stdio.h>
#include<stdlib.h>

typedef struct Queue
{
	int data[10];
	int front;
	int rear;
}queue;

void Add(queue*p, int item);
void Delete(queue*p);

int main(int argc, char const* argv[])
{
	queue* p = (queue*)malloc(sizeof(queue));
	p->front = 0;
	p->rear = 0;
	Add(p, 10);
	Delete(p);
}

void Add(queue*p, int item)
{
	//判断是否队满
	if ((p->rear+1)%10==p->front)
	{
		printf("队满了\n");
		return;
	}
	else
	{
		p->rear=(p->rear+1)%10;
		p->data[p->rear] = item;
		printf("%d已入队\n", item);
	}
}

void Delete(queue* p)
{
	//判断是否队空
	if (p->front==p->rear)
	{
		printf("队列空\n");
		return;
	}
	else
	{
		p->front = (p->front + 1) % 10;
		printf("%d已出队\n", p->data[p->front]);
	}
}

链表

#include<stdio.h>
#include<stdlib.h>

typedef struct Queue
{
	int data;
	struct Queue* next;
}queue;

typedef struct point
{
	queue* front;
	queue* rear;
}point;

void Add(point*p, int item);
void Delete(point*p);

int main(int argc, char const* argv[])
{
	queue* q = (queue*)malloc(sizeof(queue));
	q->next = NULL;
	point* p = (point*)malloc(sizeof(point));
	p->front = q;
	p->rear = q;
	Add(p, 10);
	Delete(p);
}

void Add(point* p, int item)
{
	queue* new = (queue*)malloc(sizeof(queue));
	new->data = item;
	new->next = NULL;
	p->rear->next = new;
	p->rear = new;
	printf("%d已入队\n", item);
}

void Delete(point* p)
{
	//判断是否队列空
	if (p->front->next==NULL)
	{
		printf("队列空啦\n");
	}
	else
	{
		queue* out = p->front->next;
		printf("%d已出队\n", out->data);
		p->front->next = p->front->next->next;
		free(out);
	}
}