Evaluate Reverse Polish Notation (improve)

最新推荐文章于 2022-03-25 16:52:08 发布

sophia_ppa

最新推荐文章于 2022-03-25 16:52:08 发布

阅读量314

点赞数

分类专栏： my leetcode

my leetcode 专栏收录该内容

13 篇文章 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

while, why did not I think of using stack in the first place?

Here is the improvement!

class Solution:
    # @param tokens, a list of string
    # @return an integer
    def evalRPN(self, tokens):
        stack = []
        
        for item in tokens:
            
            if item not in '+-*/':
                stack.append(item)
                
            else:
                num2 = int(stack.pop())
                num1 = int(stack.pop())
                
                if item == '+':
                    stack.append(str(num1 + num2))
                elif item == '-':
                    stack.append(str(num1 - num2))
                elif item == '*':
                    stack.append(str(num1 * num2))
                elif item == '/':
                    if num1 * num2 < 0:
                        stack.append(str(- (abs(num1) / abs(num2))))
                    else:
                        stack.append(str(num1 / num2))
        return int(stack[0])