带臭弟弟学习数据结构的第三天（后缀表达式的运算）

最新推荐文章于 2022-05-20 21:47:33 发布

呆鹅的code之旅

最新推荐文章于 2022-05-20 21:47:33 发布

阅读量182

点赞数 1

文章标签：数据结构

本文链接：https://blog.csdn.net/m0_53305868/article/details/121020861

版权

本文介绍如何评估后缀表达式，详细阐述了处理数字、运算符、负数、字符串转换为数字以及处理空格的策略。通过示例程序和测试用例，解释了遇到非法表达式时返回特殊值的处理方式。文章强调了在实现过程中需要注意的细节，并鼓励不断学习和进步。

摘要由CSDN通过智能技术生成

又是陈越奶奶的英文题~~~

6-2 Evaluate Postfix Expression (25 分)

Write a program to evaluate a postfix expression. You only have to handle four kinds of operators: +, -, x, and /.

Format of functions:

ElementType EvalPostfix( char *expr );

where expr points to a string that stores the postfix expression. It is guaranteed that there is exactly one space between any two operators or operands. The function EvalPostfix is supposed to return the value of the expression. If it is not a legal postfix expression, EvalPostfix must return a special value Infinity which is defined by the judge program.

Sample program of judge:

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

typedef double ElementType;
#define Infinity 1e8
#define Max_Expr 30   /* max size of expression */

ElementType EvalPostfix( char *expr );

int main()
{
    ElementType v;
    char expr[Max_Expr];
    gets(expr);
    v = EvalPostfix( expr );
    if ( v < Infinity )
        printf("%f\n", v);
    else
        printf("ERROR\n");
    return 0;
}

/* Your function will be put here */