def infixToPostfix(infixexpr):
prec = {} # 记录操作符的优先级
prec['*'] = 3
prec['/'] = 3
prec['+'] = 2
prec['-'] = 2
prec['('] = 1
opStack = Stack()
postfixList = []
tokenList = infixexpr.split() # 解析表达式到单词列表
for token in tokenList:
# 操作数
if token in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' or token in '0123456789': # 碰到操作数直接输出,即加入到后缀列表中
postfixList.append(token)
elif token == '(': # 碰到左括号进栈
opStack.push(token)
elif token == ')': # 碰到右括号不停弹出来,直到得到弹出来的值为左括号
topToken = opStack.pop() # 弹出栈顶元素
while topToken != '(': # 若弹出的元素不是左括号,将该元素直接输出,再继续弹出 直至弹出的元素为左括号
postfixList.append(topToken)
topToken = opStack.pop()
# 操作符
else: # 碰到操作符时,反复弹出,直到栈顶的操作符优先级比自己低
while (not opStack.isEmpty()) and (prec[opStack.peek()] >= prec[token]): # 当栈不空且栈顶操作符优先级比当前操作符优先级高时,输出栈顶的操作符
postfixList.append(opStack.pop())
opStack.push(token) # 当前操作符比栈顶的操作符优先级低时,把当前操作符push到栈中
while not opStack.isEmpty(): # 扫描完后,当栈里不为空时,把栈里元素输出
postfixList.append(opStack.pop())
return ''.join(postfixList)
# print(infixToPostfix('A * B + C * D'))
print(infixToPostfix('A * ( B + C ) * D'))
def postfixEval(postfixExpr):
operandStack = Stack()
tokenList = postfixExpr.split()
for token in tokenList:
if token in '0123456789': # 操作数直接压入栈中
operandStack.push(int(token))
else: # 操作符,从栈中取出操作数,先取出的为第二操作数,计算后的值压入栈中
operand2 = operandStack.pop()
operand1 = operandStack.pop()
result = doMath(token,operand1,operand2)
operandStack.push(result)
return operandStack.pop()
def doMath(op, op1, op2):
if op == '*':
return op1 * op2
elif op == '/':
return op1 / op2
elif op == '+':
return op1 + op2
else:
return op1 - op2
# print(postfixEval('4 5 6 + * 7 *'))
print(postfixEval('4 5 6 + * 12 *'))