实验三 栈和队列及其应用
(1) 编程实现顺序栈的基本操作,并应用栈的基本操作,实现:
a) 进制的转换。
b) 表达式的语法检查(括号的匹配)。
<stack.h>
#include <stdio.h>
#include <stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OK 1;
#define FALSE -1;
typedef int SElemType;
typedef struct {
SElemType *top;
SElemType *base;
int stacksize;
}SqStack;
//构造一个空栈
int InitStack(SqStack &S);
//销毁栈S
int DestroyStack(SqStack &S);
//清空栈
int ClearStack(SqStack &S);
//判空栈
int EmptyStack(SqStack S);
//求栈的长度;
int LengthStack(SqStack S);
//返回栈顶元素
int GetTop(SqStack S);
//插入新的栈顶元素
int Push(SqStack &S, SElemType e);
//删除栈顶元素
int Pop(SqStack &S, SElemType &e);
//打印出栈中的元素
int visit(SqStack S);
//进制转换
int Conversion();
//括号的匹配
int Match();
<stack.cpp>
#include "stack.h"
//构造一个空栈
int InitStack(SqStack &S) {
S.base = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S.base) return FALSE;
S.top = S.base;
S.stacksize = STACK_INIT_SIZE;
return OK;
}
//销毁栈S
int DestroyStack(SqStack &S) {
free(S.base);
S.base = NULL;
S.top = NULL;
S.stacksize = 0;
return OK;
}
//清空栈
int ClearStack(SqStack &S) {
S.top = S.base;
return OK;
}
//判空栈
int EmptyStack(SqStack S) {
if(S.top == S.base) return OK;
return FALSE;
}
//求栈的长度;
int LengthStack(SqStack S) {
if(!S.base) return FALSE;
return (S.top - S.base);
}
//返回栈顶元素
int GetTop(SqStack S) {
if(!S.base || S.top == S.base) return FALSE;
return *(S.top - 1);
}
//插入新的栈顶元素
int Push(SqStack &S, SElemType e) {
if(S.top - S.base >= S.stacksize) {
S.base = (SElemType *)realloc(S.base, (S.stacksize + STACKINCREMENT) * sizeof(SElemType));
if(!S.base) return FALSE;
S.top = S.base + S.stacksize;
S.stacksize += STACKINCREMENT;
}
*S.top++ = e;
return OK;
}
//删除栈顶元素
int Pop(SqStack &S, SElemType &e) {
if(!S.base || S.top == S.base) return FALSE;
e = *(--S.top);
return OK;
}
//打印出栈中的元素
int visit(SqStack S) {
if(!S.base || S.top == S.base) return FALSE;
while(S.top > S.base) {
printf("%d ",*--S.top);
}
printf("\n");
return OK;
}
//进制转换
int Conversion(){
SqStack S;
InitStack(S);
int N;
int M;
int e;
printf("请输入一个非负十进制数:");
scanf("%d",&N);
printf("请输入想要将该十进制数转换为多少进制数:");
scanf("%d",&M);
while(N) {
Push(S, N%M);
N = N/M;
}
while(EmptyStack(S) == -1) {
Pop(S, e);
printf("%d",e);
}
return 0;
}
//括号的匹配
int Match(){
char p[10], *s = p;
printf("请输入一串带括号字符串并以 # 结尾\n");
scanf("%s",s);
SqStack S;
InitStack(S);
int flag = 1;
int e;
while(*s != '#' && flag) {
switch(*s){
case '(':
case '[':
case '{':Push(S, *s);
break;
case ')':if(EmptyStack(S) == -1 && GetTop(S) == '(')
Pop(S, e);
else flag = 0;
break;
case ']':if(EmptyStack(S) == -1 && GetTop(S) == '[')
Pop(S, e);
else flag = 0;
break;
case '}':if(EmptyStack(S) == -1 && GetTop(S) == '{')
Pop(S, e);
else flag = 0;
break;
}
s++;
}
if(*s =='#' && EmptyStack(S) == -1 || flag == 0) printf("匹配失败");
else printf("匹配成功");
return 0;
}
<main.cpp>
#include <stdio.h>
#include <stdlib.h>
#include "stack.h"
int main(){
printf("---------------Stack-----------------\n");
printf("1.创建栈 2.销毁栈\n");
printf("3.清空栈 4.栈的判空 \n");
printf("5.栈的长度 6.返回栈顶元素 \n");
printf("7.插入栈顶元素 8.删除栈顶元素 \n");
printf("9.打印栈中元素 10.进制转换\n");
printf("11.括号的匹配 12.退出菜单\n");
printf("\n");
int flag = 1;
SqStack S;
do{
printf("请输入选项 1 ——12:");
int order;
scanf("%d",&order);
int i;
SElemType e;
switch(order){
case 1:InitStack(S);
if(InitStack(S) == -1) printf("创建空栈失败!\n");
else printf("创建空栈成功!\n");
printf("输入初始栈长:");
scanf("%d",&i);
printf("向栈中输入初始值:");
for(int j = 0; j < i; j++){
scanf("%d",&e);
Push(S,e);
}
break;
case 2:DestroyStack(S);
if(DestroyStack(S) == 1) printf("成功销毁栈\n");
else printf("销毁栈失败\n");
break;
case 3:ClearStack(S);
break;
case 4:if(EmptyStack(S) == 1) printf("该栈为空栈\n");
else printf("栈不为空\n");
break;
case 5:printf("栈的长度为:%d\n",LengthStack(S));
break;
case 6:printf("栈顶元素为:%d\n",GetTop(S));
break;
case 7:printf("输入将要插入栈顶的值:");
scanf("%d",&e);
Push(S,e);
printf("成功插入\n");
break;
case 8:Pop(S,e);
printf("删除的栈顶元素为:%d",e);
break;
case 9:visit(S);
break;
case 10:Conversion();
break;
case 11:Match();
break;
case 12:flag = 0;
break;
}
printf("\n");
}while(flag);
return 0;
}
(2) 编程实现队列(链队列或循环队列)的基本操作。
<SqQueue.h>
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define FALSE 0
#define MAXSIZE 11
typedef int ElemType;
typedef int Status;
typedef struct {
ElemType data[MAXSIZE];
int front;
int rear;
}SqQueue;
//初始化循环队列
Status InitQueue(SqQueue &Q);
//清空队列
Status ClearQueue(SqQueue &Q);
//判空
Status EmptyQueue(SqQueue Q);
//队列长度
Status LengthSqQueue(SqQueue &Q);
//返回队头元素
Status GetHead(SqQueue Q, ElemType &e);
//插入元素
Status InsertQueue(SqQueue &Q, ElemType e);
//删除元素
Status DeleteQueue(SqQueue &Q, ElemType &e);
//输出队列
Status OutQueue(SqQueue Q);
<SqQueue.cpp>
#include "SqQueue.h"
//初始化循环队列
Status InitQueue(SqQueue &Q){
Q.front = 0;
Q.rear = 0;
return OK;
}
//清空队列
Status ClearQueue(SqQueue &Q) {
Q.front = Q.rear = 0;
return OK;
}
//判空
Status EmptyQueue(SqQueue Q){
if(Q.front == Q.rear) return OK;
else return FALSE;
}
//队列长度
Status LengthSqQueue(SqQueue &Q){
return (Q.rear - Q.front + MAXSIZE)%MAXSIZE;
}
//返回队头元素
Status GetHead(SqQueue Q, ElemType &e){
if(Q.rear == Q.front) return FALSE;
e = Q.data[Q.front];
return OK;
}
//插入元素
Status InsertQueue(SqQueue &Q, ElemType e){
if((Q.rear+1)%MAXSIZE == Q.front) return FALSE;
Q.data[Q.rear] = e;
Q.rear = (Q.rear+1)%MAXSIZE;
return OK;
}
//删除元素
Status DeleteQueue(SqQueue &Q, ElemType &e){
if(Q.rear == Q.front) return FALSE;
e = Q.data[Q.front];
Q.front = (Q.front + 1)%MAXSIZE;
return OK;
}
//输出队列
Status OutQueue(SqQueue Q){
while(Q.front != Q.rear){
printf("%d ",Q.data[Q.front]);
Q.front = (Q.front + 1)%MAXSIZE;
}
printf("\n");
return OK;
}
<main.cpp>
#include "SqQueue.h"
int main(){
printf("---------------SqQueue-----------------\n");
printf("1.创建循环队列 2.清空队列\n");
printf("3.队列判空 4.队列长度 \n");
printf("5.返回对头元素 6.插入元素 \n");
printf("7.删除元素 8.输出 \n");
printf("9.退出菜单\n");
printf("\n");
int flag = 1;
SqQueue Q;
do{
printf("请输入选项 1 ——10:");
int order;
scanf("%d",&order);
int i;
ElemType e;
switch(order){
case 1:InitQueue(Q);
if(InitQueue(Q) == 0) printf("创建队列失败!\n");
break;
case 2:ClearQueue(Q);
break;
case 3:if(EmptyQueue(Q) == 1) printf("该队列为空\n");
else printf("队列不为空\n");
break;
case 4:printf("栈的长度为:%d\n",LengthSqQueue(Q));
break;
case 5:GetHead(Q,e);
printf("队头元素为:%d\n",e);
break;
case 6:printf("输入将要插入队头的元素:");
scanf("%d",&e);
InsertQueue(Q,e);
printf("成功插入\n");
break;
case 7:DeleteQueue(Q,e);
printf("删除的栈顶元素为:%d",e);
break;
case 8:OutQueue(Q);
break;
case 9:flag = 0;
break;
}
printf("\n");
}while(flag);
return 0;
}
应用栈和队列实现回文序列的判定
<Ishome.cpp>
#include <stdio.h>
#include <stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OK 1;
#define FALSE 0;
#define MAXSIZE 11
typedef char SElemType;
typedef char ElemType;
typedef int Status;
typedef struct {
SElemType *top;
SElemType *base;
int stacksize;
}SqStack;
typedef struct {
ElemType data[MAXSIZE];
int front;
int rear;
}SqQueue;
//构造一个空栈
int InitStack(SqStack &S) {
S.base = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S.base) return FALSE;
S.top = S.base;
S.stacksize = STACK_INIT_SIZE;
return OK;
}
//插入新的栈顶元素
int Push(SqStack &S, SElemType e) {
if(S.top - S.base >= S.stacksize) {
S.base = (SElemType *)realloc(S.base, (S.stacksize + STACKINCREMENT) * sizeof(SElemType));
if(!S.base) return FALSE;
S.top = S.base + S.stacksize;
S.stacksize += STACKINCREMENT;
}
*S.top++ = e;
return OK;
}
//删除栈顶元素
int Pop(SqStack &S, SElemType &e) {
if(!S.base || S.top == S.base) return FALSE;
e = *(--S.top);
return OK;
}
//初始化循环队列
Status InitQueue(SqQueue &Q){
Q.front = 0;
Q.rear = 0;
return OK;
}
//插入元素
Status InsertQueue(SqQueue &Q, ElemType e){
if((Q.rear+1)%MAXSIZE == Q.front) return FALSE;
Q.data[Q.rear] = e;
Q.rear = (Q.rear+1)%MAXSIZE;
return OK;
}
//删除元素
Status DeleteQueue(SqQueue &Q, ElemType &e){
if(Q.rear == Q.front) return FALSE;
e = Q.data[Q.front];
Q.front = (Q.front + 1)%MAXSIZE;
return OK;
}
//判断回文
Status Ishome(char p[]){
SqQueue Q;
SqStack S;
InitQueue(Q);
InitStack(S);
if(!InitQueue(Q)) return FALSE;
if(!InitStack(S)) return FALSE;
int i = 0;
while(p[i]) {
Push(S, p[i]);
InsertQueue(Q, p[i]);
i++;
}
SElemType e1;
ElemType e2;
for(i; i > 0; i-- ){
Pop(S, e1);
DeleteQueue(Q, e2);
if(e1 != e2) return FALSE;
}
return OK;
}
int main() {
char p[10];
scanf("%s",&p);
if(Ishome(p)) printf("%s是回文",p);
else printf("%s不是回文",p);
return 0;
}