C中中缀表达式转换为后缀（RPN）的最短方法

中缀表达式是人类常用的数学表达方式，但对于计算机来说，后缀表达式更容易处理。因此，将中缀表达式转换为后缀表达式是一项重要的任务。本文将介绍一种最短的方法，以及相关的案例代码。

python
def infix_to_postfix(infix_expression):
    operator_stack = []
    output = []
    operators = {'+': 1, '-': 1, '*': 2, '/': 2, '(': 0}
    
    for token in infix_expression:
        if token.isdigit():
            output.append(token)
        elif token == '(':
            operator_stack.append(token)
        elif token == ')':
            while operator_stack[-1] != '(':
                output.append(operator_stack.pop())
            operator_stack.pop()
        else:
            while operator_stack and operators[token] <= operators.get(operator_stack[-1], 0):
                output.append(operator_stack.pop())
            operator_stack.append(token)
    
    while operator_stack:
        output.append(operator_stack.pop())
    
    return output
infix_expression = "2 + 3 * 4"
postfix_expression = infix_to_postfix(infix_expression)
print("后缀表达式:", ' '.join(postfix_expression))