~~~
#include<stdio.h>
#include<windows.h>
#include<malloc.h>
#define maxsize 100
typedef char elemtype;
typedef struct //隊列的定義
{
elemtype data[maxsize];
int front,rear;
}sqqueue;
void initqueue(sqqueue *&q) //隊列的初始化
{
q=(sqqueue *)malloc(sizeof(sqqueue));
q->front=q->rear=-1;
}
void enqueue(sqqueue *q) //進隊
{
char e;
getchar();
printf("請輸入需進隊元素:");
scanf("%c",&e);
if(q->rear==maxsize-1)
printf("隊滿，進隊失敗!\n");
else
{
q->rear++;
q->data[q->rear]=e;
printf("進隊成功\n");
}
}
void queueempty(sqqueue *q) //判斷隊列是否為空
{
if(q->rear==q->front)
printf("隊列為空!\n");
else
printf("隊列不為空!\n");
}
void dequeue(sqqueue *q) //出隊
{
char m;
if(q->rear==q->front)
printf("隊空，出隊失敗!\n");
else
{
q->front++;
m=q->data[q->front];
printf("出隊元素為:%c\n",m);
}
}
void destroy(sqqueue *q) //銷毀隊列
{
char m;
getchar();
printf("確定要銷毀隊列請輸入y 否則不銷毀!\n");
scanf("%c",&m);
if(m=='y')
{
free(q);
printf("隊列已銷毀!\n");
exit(0);
}
else
printf("隊列未銷毀!\n");
}
int length(sqqueue *q) //求隊列的長度
{
int n=q->rear-q->front;
return n;
}
void main()
{
sqqueue *q;
int m;
printf(" *************歡迎使用隊列的運算系統****************\n");
initqueue(q);
while(1)
{
printf("請選擇:");
printf("1 進隊\n");
printf(" 2 出隊\n");
printf(" 3 判斷隊列是否為空\n");
printf(" 4 銷毀隊列\n");
printf(" 5 求隊列的長度\n");
printf(" 6 退出\n");
scanf("%d",&m);
switch(m)
{
case 1:enqueue(q);break;
case 2:dequeue(q);break;
case 3:queueempty(q);break;
case 4:destroy(q);break;
case 5:printf("隊列的長度為:%d\n",length(q));break;
case 6:exit(0);
default:printf("輸入錯誤，請從新輸入!\n");
}
}
}
~~~
