数据结构——数组仿真队列

#include<stdio.h>
#include<stdlib.h>
int queue[5] = { 0 };
int front = -1;
int rear = -1;

void addqueue(int value)
{
	if (rear >= 5)
		printf("队列已满!!\n");
	else
	{
		rear++;
		queue[rear] = value;
	}
}

int delqueue()
{
	int temp;
	if (front == rear)
		return -1;
	else
	{
		front++;
		temp = queue[front];
		queue[front] = 0;
		return temp;
	}
}

void display()
{
	int i;
	for (i = 0; i < 5; i++)
	{
		if (queue[i] != 0)
			printf("%4d", queue[i]);
	}
	printf("\n");
}

int main()
{
	int x = 0;
	for (int i = 0; i < 5; i++)
	{
		printf("请输入你要插入队列的数据:");
		scanf("%d", &x);
		addqueue(x);
	}
	printf("队列的元素为：");
	display();
	for (int i = 0; i < 5; i++)
	{
		printf("出队列的元素为:%d\n", delqueue());
	}
	system("pause");
	return 0;
}