C语言利用栈求解后缀表达式及其值

最新推荐文章于 2022-02-26 09:32:28 发布

zcharlotteyq

最新推荐文章于 2022-02-26 09:32:28 发布

阅读量965

点赞数 2

分类专栏：数据结构文章标签：栈 c语言

本文链接：https://blog.csdn.net/m0_49119161/article/details/108998723

版权

#include <stdio.h>
#include <stdlib.h>
#define MaxSize 25
typedef struct
{
   
	char data[MaxSize];
	int top;
}SqType;
typedef struct
{
   
	double data[MaxSize];
	int top;
}SqType1;
void InitStack(SqType*& s) {
   
	s = (SqType*)malloc(sizeof(SqType));
	s->top = -1;
}
void DestroyStack(SqType*& s) {
   
	free(s);
}
bool StackEmpty(SqType* s) {
   
	return s->top == -1;
}
bool Push(SqType*& s, char e) {
   
	if (s->top == MaxSize - 1) {
   
		return false;//满
	}
	s->top++;
	s->data[s->top] = e;
	return true;
}
bool Pop(SqType*& s, char& e) {
   
	if (s->top == -1) {
   
		return false;//栈空
	}
	e = s->data[s->top];
	s->top--;
	return true;
}
bool GetTop(SqType* s, char& e) {
   
	if (s->top == -1) {
   
		return false;
	}
	e = s