令人抓狂的四则运算pta

#include <stdio.h>
#include <string.h>
 
char s[100];
double stk_num[100];
char stk_fu[100];
 
int is_number(char c)
{
    return c >= '0' && c <= '9' || c == '.';
}
 
int check(char a, char b)
{
    if(a == '+' || a == '-')
    {
        if(b == '+' || b == '-')return 0;
        else return 1;
    }
    else if(a == '*' || a == '/')
    {
        if(b == '(')return 1;
        else return 0;
    }
    else if(a == '(')
    {
        if(b == ')')return 0;
        else return 1;
    }
}
 
double fun(double a, char c, double b)
{
    if(c == '-')return b - a;
    if(c == '+')return b + a;
    if(c == '*')return b * a;
    if(c == '/')return b / a;
}
 
int main()
{
    int len;
    int top_num;
    int top_fu;
    while(1)
    {
        scanf("%s", s);
        if(s[0] == '=')break;
        len = strlen(s);
        top_num = 0, top_fu = 0;
        for(int i = 0; i < len; i++)
        {
            // printf("i = %d top_num = %d top_fu = %d\n", i, top_num, top_fu);
            // for(int m = 1; m <= top_num; m++)printf("%f ",stk_num[m]);
            // printf("\n");
            // for(int m = 1; m <= top_fu; m++)printf("%c ", stk_fu[m]);
            // printf("\n");
            //处理数字部分
            if(is_number(s[i]))
            {
                double number = 0;
                
                int j, k;
                for(j = i; j < len && s[j] != '.' && is_number(s[j]) != 0; j++)
                    number = number * 10 + s[j] - '0';
                
                k = j;
                
                if(s[j] =='.')
                {
                    double m = 0.1;
                    for(k = j + 1; k < len && is_number(s[k]) != 0; k++)
                    {
                        number += m * (s[k] - '0');
                        m /= 10;
                    }
                }
                if(i == 1 && s[0] == '-' || i > 1 && s[i - 1] == '-' && is_number(s[i - 2]) == 0)
                    number *= -1;
                i = k - 1;
                stk_num[++top_num] = number;
            }
            // 处理符号部分
            else 
            {
                //将非符号部分排除
                if((s[i] == '+' || s[i] == '-') && (i == 0 || s[i - 1] == '(' || (is_number(s[i - 1]) == 0 && s[i - 1] != ')')))
                    continue;
                //讨论当 ')' 时的情况
                if(s[i] == ')')
                {
                    while(stk_fu[top_fu] != '(')
                    {
                        double a = stk_num[top_num--], b = stk_num[top_num--];
                        char c = stk_fu[top_fu--];
                        stk_num[++top_num] = fun(a, c, b);
                    }
                    top_fu--;
                }
                else 
                {
                    //普通情况
                    if(top_fu == 0)stk_fu[++top_fu] = s[i];
                    else 
                    {
                        //如若s[i]大一级直接压栈 否则拿出来计算
                        if(check(stk_fu[top_fu], s[i]) == 1)stk_fu[++top_fu] = s[i];
                        else 
                        {
                            //当符号栈为空或符号栈定优先级更大位置
                            while(top_fu != 0 && check(stk_fu[top_fu], s[i]) == 0)
                            {
                                double a = stk_num[top_num--], b = stk_num[top_num--];
                                char c = stk_fu[top_fu--];
                                stk_num[++top_num] = fun(a, c, b);
                            }
                            stk_fu[++top_fu] = s[i];
                        }
                    }
                }
            }
        }
        while(top_fu != 0)
        {
            double a = stk_num[top_num--], b = stk_num[top_num--];
            char c = stk_fu[top_fu--];
            stk_num[++top_num] = fun(a, c, b);
        }
        printf("%.1f\n", stk_num[top_num]);
    }
    return 0;
}