PTA Evaluate Postfix Expression (10 分)

• 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 */

---

Sample Input 1:

11 -2 5.5 * + 23 7 / -
结尾无空行

Sample Output 1:

-3.285714
结尾无空行

---

Sample Input 2:

11 -2 5.5 * + 23 0 / -

Sample Output 2:

ERROR

---

Sample Input 3:

11 -2 5.5 * + 23 7 / - *

Sample Output 3:

ERROR

Special thanks to Sirou Zhu (朱思柔) for providing a valuable test case.

---

AC:

ElementType EvalPostfix(char *expr)
{
    ElementType stack[Max_Expr];
    char num[Max_Expr];
    int i = 0, j = 0;
    int top = -1;
    ElementType x, y;
    while (expr[i] != '\0') /* '\0' 是字符串的结束符 */
    {
        while (expr[i] == ' ')
            i++;
        if (isdigit(expr[i]) || expr[i] == '.') /* isdigit()判断一个字符是否是十进制数字 */
        {
            num[j++] = expr[i];
            if (expr[i + 1] == ' ' || expr[i + 1] == '\0')
            {
                num[j] = '\0';
                stack[++top] = atof(num); /* atof()将字符串转换为double(双精度浮点数) */
                j = 0;
            }
        }
        else
        {
            if (expr[i] == '-' || expr[i] == '+')
            {
                if (isdigit(expr[i + 1]))
                {
                    num[j++] = expr[i];
                }
                else if (expr[i + 1] == ' ' || expr[i + 1] == '\0')
                {
                    if (top)
                    {
                        x = stack[top--];
                        y = stack[top];
                        if (expr[i] == '+')
                            stack[top] = y + x;
                        else
                            stack[top] = y - x;
                    }
                    else
                        return Infinity;
                }
            }
            else if (expr[i] == '*' || expr[i] == '/')
            {
                if (top)
                {
                    x = stack[top--];
                    y = stack[top];
                    if (expr[i] == '*')
                        stack[top] = y * x;
                    else
                    {
                        if (x)
                            stack[top] = y / x;
                        else
                            return Infinity;
                    }
                }
                else
                    return Infinity;
            }
        }
        i++;
    }
    if (!top)
        return stack[top];
    else
        return Infinity;
}

---

上面引用 isdigit() 函数时缺少了 <ctype.h>头文件！

ElementType EvalPostfix( char *expr ) {
    char t[10];
    double s[100],flag;
    int c = 0,k = 0;
    while(expr[k]) {
        int j = 0;
        while(expr[k] && expr[k] != ' ') t[j ++] = expr[k ++];
        t[j] = 0;
        if(t[0] >= '0' && t[0] <= '9' || t[1] && (t[0] == '-' || t[0] == '+')) {
            s[c] = 0;
            int i = 0;
            flag = 1;
            if(t[i] == '-') {
                flag = -1;
                i ++;
            }
            if(t[i] == '+') i ++;
            while(t[i] && t[i] != '.') {
                s[c] = s[c] * 10 + t[i ++] - '0';
            }
            if(t[i] == '.') {
                i ++;
                double d = 0.1;
                while(t[i]) {
                    s[c] += (t[i ++] - '0') * d;
                    d *= 0.1;
                }
            }
            s[c] *= flag;
            c ++;
        }
        else {
            if(c < 2) return Infinity;
            switch(t[0]) {
                case '+':s[c - 2] += s[c - 1];break;
                case '-':s[c - 2] -= s[c - 1];break;
                case '*':s[c - 2] *= s[c - 1];break;
                case '/': if(s[c - 1] == 0) return Infinity;
                          s[c - 2] /= s[c - 1];break;
            }
            c --;
        }
        while(expr[k] && expr[k] == ' ') k ++;
    }
    if(c > 1) return Infinity;
    return s[0];
}

---

此方法转自【链接】