中缀转后缀表达式、逆波兰表达式、leetcode224、227

SoulOSQ

已于 2022-08-26 02:22:39 修改

阅读量257

点赞数

分类专栏： leetcode 文章标签： python

于 2022-06-08 01:14:29 首次发布

本文链接：https://blog.csdn.net/qq_36132590/article/details/125176450

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

中缀转后缀表达式python leetcode224、227

class Solution:
    def calculate(self, s):           # 中缀转后缀
        def evalRPN(tokens):
            stack = []
            for token in tokens:
                if token.isnumeric() or token[0]=="-" and token[1:].isnumeric():
                    stack.append(token)
                else:
                    x = int(stack.pop())
                    y = int(stack.pop())
                    if token == "-":
                        stack.append(y-x)
                    elif token == "+":
                        stack.append(y+x)
                    elif token == "*":
                        stack.append(y*x)
                    elif token == "/":
                        stack.append(y/x)
            return int(stack[-1])
        op_priority = {'+': 0, '-': 0, '*': 1, '/': 1, '%': 1, '^': 2}      # 定义操作符优先级
        if s[0] == "-": s="0"+s       # 第一个数字是负数
        s = "(" + s.replace(" ", "").replace("(-", "(0-").replace("--","+").replace("+-","-") + ")"   # 注：不能解决*-和/-
        n = len(s)
        op_stack = []    # 符号操作栈
        RPN = []         # 后缀表达式
        i = 0
        while i < n:
            c = s[i]     # 当前字符
            i += 1       # 下一个字符
            if c.isdigit():
                num = int(c)  # 当前字符
                while i < n and s[i].isdigit(): # 下一个字符
                    num = num * 10 + int(s[i])
                    i += 1
                RPN.append(str(num))
            elif c == '(':  # (
                op_stack.append(c)
            elif c == ')':  # calculate until see '('
                while op_stack and op_stack[-1] != '(':
                    RPN.append(op_stack.pop())
                op_stack.pop()
            else:
                while op_stack and op_stack[-1] != '(':
                    if op_priority[c] <= op_priority[op_stack[-1]]:
                    	RPN.append(op_stack.pop())
                    else:
                        break
                op_stack.append(c)
        return evalRPN(RPN)