【顺序队列】

队列-------(先进先出)

队列是限制在两端进行插入操作和删除操作的线性表
允许进行存入操作的一端称为“队尾”
允许进行删除操作的一端称为“队头”
当线性表中没有元素时，称为“空队”

规定：front指向队头元素的位置; rear指向队尾元素的下一个位置。
在队列操作过程中，为了提高效率，以调整指针代替队列元素的移动，并将数组作为循环队列的操作空间。
为区别空队和满队，满队元素个数比数组元素个数少一个。

思路

程序

queue.h

#pragma once
typedef int datatype;
#define N 6

typedef struct {
	datatype data[N];
	int front;
	int rear;
}sequeue;

sequeue * queue_create();//创建队列
int enqueue(sequeue *sq, datatype x);//入队
datatype dequeue(sequeue *sq);//出队
int queue_empty(sequeue *sq);//判断队列是否为空
int queue_full(sequeue *sq);//判断队列是否满
int queue_clear(sequeue *sq);//清空队列
sequeue * queue_free(sequeue *sq);//释放队列
int queue_show(sequeue *sq); //显示队列数据

queue.c

#include <stdio.h>
#include <stdlib.h> 
#include <string.h>
#include "queue.h"

sequeue * queue_create()
{
	sequeue * sq;
	sq = (sequeue*)malloc(sizeof(sequeue));
	if (sq == NULL) {
		printf("queue is NULL\n");
		return NULL;
	}
	memset(sq->data,0,sizeof(sq->data));
	sq->front = 0;
	sq->rear = 0;
	
	return sq;
}

int enqueue(sequeue * sq, datatype x)
{
	if (sq == NULL) {
		printf("sequeue is null\n");
		return -1;
	}

	if (((sq->rear+1)% N) == sq->front)
	{
		printf("sequeue is full....\n");
		return -1;
	}

	sq->data[sq->rear] = x;
	sq->rear = (sq->rear+1) % N;

	return 0;
}

datatype dequeue(sequeue * sq)
{
	datatype n;
	if (sq->front == sq->rear)
	{
		printf("sequeue is null\n");
		return -1;
	}
	n = sq->data[sq->front];
	sq->front = (sq->front+1) %N;
	return n;
}

int queue_empty(sequeue * sq)
{
	if (sq == NULL) {
		printf("sequeue is null\n");
		return -1;
	}

	return sq->front == sq->rear ? 1 : 0;
}

int queue_full(sequeue * sq)
{
	if (sq == NULL) {
		printf("sequeue is null\n");
		return -1;
	}

	if (((sq->rear + 1) % 6) == sq->front)
	{
		printf("sequeue is full\n");
		return 1;
	}
	else return 0;
}

int queue_clear(sequeue * sq)
{
	if (sq == NULL) {
		printf("sequeue is null\n");
		return -1;
	}
	sq->front = 0;
	sq->rear = 0;
	return 0;
}

sequeue * queue_free(sequeue * sq)
{
	if (sq == NULL) {
		printf("sequeue is null\n");
		return NULL;
	}
	free(sq);
	sq = NULL; 
	return NULL;
}

int queue_show(sequeue * sq)
{
	int i, j;
	i=sq->front;
	j = sq->rear;
	if (sq == NULL) {
		printf("sequeue is null\n");
		return -1;
	}
	if (i == j)
		return -1;
	while (i!=j)
	{
		printf("%d\n", sq->data[i]);
		i = (i + 1) % N;
	}
	return 0;
}

test.c

#include <stdio.h>
#include "queue.h"


int  main()
{
	sequeue *sq;
	if ((sq = queue_create()) == NULL) {
		return -1;
	}

	enqueue(sq, 1);
	enqueue(sq, 2);
	enqueue(sq, 3);
	enqueue(sq, 4);
	enqueue(sq, 5);

	
	printf("dequeue:%d\n", dequeue(sq));
	printf("dequeue:%d\n", dequeue(sq));
	enqueue(sq, 6);
	enqueue(sq, 7);
	enqueue(sq, 8);

	queue_show(sq);

	while (!queue_empty(sq)) {
		printf("dequeue:%d\n", dequeue(sq));
	}
	queue_free(sq);

	system("pause");
	return 0;
}