回文(数据结构)

//借助栈和链队列判断序列是否回文

#include

#include

#define ERROR 0

#define OK 1

#define STACK_INT_SIZE 10 /*存储空间初始分配量*/

#define STACKINCREMENT 5 /*存储空间分配增量*/

typedef char ElemType; /*定义元素的类型*/

typedef struct{

ElemType *base;

ElemType *top;

int stacksize; /*当前已分配的存储空间*/

}SqStack;

typedef struct QNode{

ElemType data;

struct QNode *next;

}QNode,*Queue;

typedef struct{

Queue front;

Queue rear;

}LinkQueue;

int InitStack(SqStack *S){

S->base=(ElemType *)malloc(STACK_INT_SIZE *sizeof(ElemType));

if(!S->base) return ERROR;

S->top=S->base;

S->stacksize=STACK_INT_SIZE;

return OK;

}/*InitStack*/

int Push(SqStack *S,ElemType e){

if(S->top-S->base>=S->stacksize){

S->base=(ElemType*)realloc(S->base,(STACK_INT_SIZE+STACKINCREMENT)*sizeof(ElemType));

if(!S->base) return ERROR;

S->top=S->base+S->stacksize;S->stacksize=S->stacksize+STACKINCREMENT;

}

*S->top++=e;

return OK;

}/*Push*/

int Pop(SqStack *S,ElemType &e){

if(S->top==S->base)return ERROR;

e=*--S->top;

return OK;

}/*Pop*/

int initQueue(LinkQueue &Q)

{

Q.front=Q.rear=(Queue)malloc(sizeof(QNode));

Q.front->next=NULL;

return OK;

}

int EnQueue(LinkQueue &Q,ElemType e)

{

Queue p;

p=(Queue)malloc(sizeof(QNode));

p->data=e;

p->next=NULL;

Q.rear->next=p;

Q.rear=p;

return OK;

}

int DeQueue(LinkQueue &Q,ElemType &e)

{

Queue p;

if(Q.front==Q.rear) return ERROR;

p=Q.front->next;

e=p->data;

Q.front->next=p->next;

if(Q.rear==p) Q.rear=Q.front;

free(p);

return OK;

}

void main()

{

LinkQueue q;

SqStack s;

int i,m=0;

char a[10],b[10],c[10];

printf("请输入字符序列：");

for(i=0;i<10;i++)

scanf("%c",&a[i]);

InitStack(&s);

initQueue(q);

for(i=0;i<10;i++)

{

Push(&s,a[i]);

EnQueue(q,a[i]);

}

printf("正序序列为：");

for(i=0;i<10;i++)

{

DeQueue(q,c[i]);

printf("%c",c[i]);

}

printf("\n逆序序列为：");

for(i=0;i<10;i++)

{

Pop(&s,b[i]);

printf("%c",b[i]);

}

for(i=0;i<10;i++)

{

if(a[i]==b[i]) m=1;

else

{

m=0;break;

}

}

if(m)

printf("\n该序列是回文序列\n");

else

printf("\n该序列不是回文序列\n"); }