用队列实现形如a+b@b+a#的中心对称的字符序列的检验（循环队列）

用队列实现形如a+b@b+a#的中心对称的字符序列的检验（循环队列）

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

#define MAXQSIZE 100

#define TRUE 1
#define FALSE 0
#define OK 1
#define INFEASIBLE -1
#define OVERFLOW -2
#define ERROR 0

typedef char QElemType;
typedef int Status;

typedef struct{
QElemType *base;
int front;
int rear;
}SqQueue;

Status InitQueue(SqQueue &Q)
{
Q.base=(QElemType *)malloc(MAXQSIZE *sizeof(QElemType));
if(!Q.base) exit(OVERFLOW);
Q.front=Q.rear=0;
return OK;
}

int QueueLength(SqQueue Q)
{
return (Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;
}
Status EnQueue(SqQueue &Q,QElemType e)
{
if ((Q.rear+1)%MAXQSIZE==Q.front) return ERROR;
Q.base[Q.rear]=e;
Q.rear=(Q.rear+1)%MAXQSIZE;
return OK;
}

Status DeQueue(SqQueue &Q,QElemType &e)
{
if(Q.front==Q.rear)
return ERROR;
e=Q.base[Q.front];
Q.front=(Q.front+1)%MAXQSIZE;
return OK;
}

Status DeQueuefront(SqQueue &Q,QElemType &e)
{
if(Q.front ==Q.rear) return ERROR;
e=Q.base[Q.front];
Q.front=(Q.front+1)%MAXQSIZE;
return OK;
}

Status DeQueuerear(SqQueue &Q,QElemType &e)
{
if(Q.front ==Q.rear) return ERROR;
Q.rear = (Q.rear - 1) % MAXQSIZE;
e=Q.base[Q.rear];
return OK;
}

Status Symmetry(char a[])
{
SqQueue q;
char b,c;
char *p=a;
InitQueue(q);
while(*p!=’@’)
{
EnQueue(q,*p);
p++;
}
p++;
while(*p!=’#’)
{
EnQueue(q,*p);
p++;
}
if(QueueLength(q)!=0)
{
if(!DeQueuefront(q,b)) return OVERFLOW;
if(!DeQueuerear(q,c)) return OVERFLOW;
if(b!=c) return FALSE;
}
if(q.rear==q.front) return OK;
}

int main()
{
char a[20];
scanf("%s",a);
if(Symmetry(a))
printf(“中心对称”);
else
printf(“不中心对称”);
return 0;
}