150. Evaluate Reverse Polish Notation【M】【19】

最新推荐文章于 2022-03-30 11:14:00 发布

sscssz

最新推荐文章于 2022-03-30 11:14:00 发布

阅读量399

点赞数

分类专栏： leetcode 技术学习 Python 算法栈文章标签： leetcode题解 leetcode python string 栈

本文链接：https://blog.csdn.net/sscssz/article/details/51435234

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

Some examples:

  ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9
  ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6

Subscribe to see which companies asked this question

class Solution(object):
    def evalRPN(self, tokens):

        s = []

        for i in tokens:

            if i == "+":
                t = s[-1] + s[-2]
                s = s[:-2]
                s += t,
            elif i == "-":
                t = s[-2] - s[-1]
                s = s[:-2]
                s += t,
            elif i == "*":
                t = s[-2] * s[-1]
                s = s[:-2]
                s += t,
            elif i == "/":
                if s[-2]*s[-1] < 0:
                    t = - (abs(s[-2]) / abs(s[-1]))
                else:
                    t = s[-2] / s[-1]
                s = s[:-2]
                s += t,
            else:
                i = int(i)
                s += i,
                #print s
        return s[0]