#include #include #include #define MAX_SIZE 100 // 定义栈结构 typedef struct { int data[MAX_SIZE]; int top; } Stack; void initStack(Stack *s) { s->top = -1; } int isEmpty(Stack *s) { return s->top == -...-Go服务器开发

你可以在 evaluate 函数中添加判断优先级的功能。可以使用一个优先级比较函数来比较两个运算符的优先级，然后根据优先级来决定是否需要弹出栈中的运算符进行计算。

下面是修改后的代码示例：

int priority(char operator) {
    if (operator == '*' || operator == '/')
        return 2;
    else if (operator == '+' || operator == '-')
        return 1;
    else
        return 0; // 括号或其他非法字符
}
// ...
void evaluateExpression(Stack *operandStack, Stack *operatorStack) {
    char op = pop(operatorStack);
    int b = pop(operandStack);
    int a = pop(operandStack);
    int result = calculate(a, op, b);
    push(operandStack, result);
}
int evaluate(char *expression) {
    Stack operandStack; // 操作数栈
    Stack operatorStack; // 运算符栈
    initStack(&operandStack);
    initStack(&operatorStack);
    int i = 0;
    
    while (expression[i] != '\0') {
        
        // ...
        
        } else if (expression[i] == '+' || expression[i] == '-' || expression[i] == '*' || expression[i] == '/') { // 处理运算符
            while (!isEmpty(&operatorStack) && peek(&operatorStack) != '(' && priority(expression[i]) <= priority(peek(&operatorStack))) {
                evaluateExpression(&operandStack, &operatorStack);
            }
            push(&operatorStack, expression[i]);
            i++;
            
        // ...
        
       } else if (expression[i] == ')') { // 处理右括号
            while (!isEmpty(&operatorStack) && peek(&operatorStack) != '(') {
                evaluateExpression(&operandStack, &operatorStack);
            }
            // ...
        }
        
        // ...
    }
    // ...
}