线性结构——用栈实现波兰表达式求值。

最新推荐文章于 2022-08-07 17:45:33 发布

gzhu_wzb

最新推荐文章于 2022-08-07 17:45:33 发布

阅读量850

点赞数 1

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_34174814/article/details/70176682

版权

//PolishExpression_H.h

#pragma once
//用栈实现兰波表达式求值
#define OK true
#define ERROR false
#define OVERFLOW -1
#define MAXSIZE 100

typedef float ElemType;
typedef bool Status;



typedef struct Stack {
	ElemType *base;
	ElemType *top;
	int stacksize;
}STACK;

Status InitStack(STACK &S);
Status StackFull(STACK S);
Status Push(STACK &S, ElemType e);
Status StackEmpty(STACK S);
ElemType Pop(STACK &S);
void PolishExpression();

//PolishExpression_achieve

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


Status InitStack(STACK &S) {
	S.base = new ElemType[MAXSIZE];
	if (!S.base) {
		printf("内存分配失败！\n");
		exit(OVERFLOW);
	}
	S.top = S.base;
	return OK;
}

Status StackFull(STACK S) {