#include <stdlib.h>
#include<iostream>
using namespace std;
#include<malloc.h>
#include<stdio.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int QElemType;
typedef int Status;
//队列的链式存储表示
typedef struct QNode{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr front;//队头指针
QueuePtr rear;//队尾指针
}LinkQueue;
LinkQueue Q;
//1.初始化队列
Status InitQueue(LinkQueue &Q){
Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
if(!Q.front)exit(OVERFLOW);
Q.front->next=NULL;
return OK;
}
//2.销毁队列
Status DestroyQueue(LinkQueue &Q){
while(Q.front){
Q.rear=Q.front->next;
free(Q.front);
Q.front=Q.rear;
}
return OK;
}
//3.清空队列
Status ClearQueue(LinkQueue &Q){
Q.front=Q.rear=0;
return OK;
}
//4.队列判空
Status QueueEmpty(LinkQueue Q){
if(Q.front == Q.rear)
return 0;
else
return 1;
}
//5.求队列长度
int QueueLength(LinkQu