C语言用栈和队列实现的回文检测功能示例语言用栈和队列实现的回文检测功能示例
本文实例讲述了C语言用栈和队列实现的回文功能。分享给大家供大家参考，具体如下：
#include<stdio.h>
#include<malloc.h>//内存分配头文件
#include<math.h>//在math.h中已定义OVERFLOW的值为3
#define SIZE 100
#define STACKINCREMENT 10
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;
typedef struct //栈的结构体
{
char a;
} SElemType;
typedef struct
{
SElemType *base;
SElemType *top;
int stacksize;
} SqStack;
typedef struct //QNode //队列的结构体
{
char b;
struct QNode * next;
} QNode,*QueuePtr;
typedef struct // 链队列类型
{
QueuePtr front; // 队头指针
QueuePtr rear; // 队尾指针
} LinkQueue;
//定义全局变量
SqStack S;
SElemType e;
LinkQueue Q;
QueuePtr p;
char f;
//栈操作
Status InitStack(SqStack *S)
{
S->base=(SElemType *)malloc(SIZE*sizeof(SElemType));
if(!S->base) exit(OVERFLOW);
S->top=S->base;
S->stacksize=SIZE;
return OK;
}
Status Push(SqStack *S,SElemType e)
{
if(S->top-S->base>=S->stacksize)
{
S->base=(SElemType *)malloc((S->stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S->base) exit(OVERFLOW);
S->top=S->base+S->stacksize;
S->stacksize+=STACKINCREMENT;
}
*S->top++=e;
return OK;
}
Status Stackempty(SqStack S)//栈是否为空
{
if(S.top==S.base)
return TRUE;
else
return FALSE;
}
Status Pop(SqStack *S,SElemType *e)
{
if(S->top==S->base) return ERROR;
*e=*--S->top;
return OK;
}
Status StackLength(SqStack S)//求栈的长度
{
return (S.top-S.base);
}
资源评论
