leetcode 150. 逆波兰表达式求值

最新推荐文章于 2025-07-26 21:22:10 发布

ranzhiyimu

最新推荐文章于 2025-07-26 21:22:10 发布

阅读量252

点赞数 3

CC 4.0 BY-SA版权

文章标签： leetcode python 算法

本文链接：https://blog.youkuaiyun.com/ranzhiyimu/article/details/146541996

150. 逆波兰表达式求值 - 力扣（LeetCode）

class Solution:
    def evalRPN(self, tokens: List[str]) -> int:
        stack=[]
        for item in tokens:
            if item not in ( '+','-','*' , '/' ):
                stack.append(item)
            else:
                pre=int(stack.pop())
                pre_before=int(stack.pop())
                sign =item
                if sign =='/':
                    result=int(pre_before/pre)
                elif sign =='+':
                    result=pre_before+pre
                elif sign =='-':
                    result=pre_before-pre
                elif sign =='*':
                    result=pre_before*pre
                stack.append(result)
        return int(stack.pop())