后缀表达式求值

本文介绍了一个使用C语言编写的程序,该程序能够解析并计算后缀表达式的值。通过堆栈结构来处理运算符和操作数,实现了对加、减、乘、除等基本算术运算的支持。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

设计一个程序,输入一个后缀表达式,然后利用堆栈结构的原理,实现求值

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int judgeSymbol(char symbol)
{
	int answer = 317;
	switch (symbol)
	{
	case '+':
		answer = 1; break;
	case '-':
		answer = 2; break;
	case '*':
		answer = 3; break;
	case '/':
		answer = 4; break;
	default:
		break;
	}

	return answer;
}
int main(int argc, char **argv)
{
	int i = 0;
	double mathsAnswer[21] = { '\0' };
	char problem[71] = { '\0' };
	int judge = 666;
	gets_s(problem,70);
	int j = 0;
	int len = strlen(problem);
	for (i = 0; i < len; i++)
	{
		if (problem[i] == ' ')
			continue;//当读取到空格时,抛弃空格
		else if (problem[i] >= '0'&&problem[i] <= '9')
		{
			mathsAnswer[j++] = atof(&problem[i]);
			while (1)
			{
				i++;
				if (problem[i] == ' ')
				{
					i--;
					break;
				}
			}
		}
		else if ((problem[i] == '+' && (problem[i + 1] >= '0'&&problem[i + 1] <= '9')) || (problem[i] == '-'&&problem[i + 1] >= '0'&&problem[i + 1] <= '9'))
		{
			mathsAnswer[j++] = atof(&problem[i]);
			while (1)
			{
				i++;
				if (problem[i] == ' ')
				{
					i--;
					break;
				}
			}
		}
		else
		{
			judge = judgeSymbol(problem[i]);
			if (judge == 1)
			{
				j--;
				mathsAnswer[j - 1] = mathsAnswer[j - 1] + mathsAnswer[j];
				mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
			}
			else if (judge == 2)
			{
				j--;
				mathsAnswer[j - 1] = mathsAnswer[j - 1] - mathsAnswer[j];
				mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
			}
			else if (judge == 3)
			{
				j--;
				mathsAnswer[j - 1] = mathsAnswer[j - 1] * mathsAnswer[j];
				mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
			}
			else if (judge == 4)
			{
				j--;
				if (mathsAnswer[j] == 0)
				{
					printf("ERROR");
					return 0;
				}
				mathsAnswer[j - 1] = mathsAnswer[j - 1] / mathsAnswer[j];
				mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
			}
			judge = 666;
		}
	}
	if (mathsAnswer[1] != '\0')
		printf("ERROR");
	else
		printf("%.1f\n", mathsAnswer[0]);

	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

matthew_leung

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值