1. 题目描述
题目来源:力扣
根据 逆波兰表示法,求表达式的值。
有效的算符包括 +、-、*、/ 。每个运算对象可以是整数,也可以是另一个逆波兰表达式。
注意 两个整数之间的除法只保留整数部分。
可以保证给定的逆波兰表达式总是有效的。换句话说,表达式总会得出有效数值且不存在除数为 0 的情况。
示例1. 输入:tokens = ["2","1","+","3","*"] 输出:9 解释:该算式转化为常见的中缀算术表达式为:((2 + 1) * 3) = 9
示例2. 输入:tokens = ["4","13","5","/","+"] 输出:6 解释:该算式转化为常见的中缀算术表达式为:(4 + (13 / 5)) = 6
实例3. 输入:tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"] 输出:22 解释:该算式转化为常见的中缀算术表达式为: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5 = ((10 * (6 / (12 * -11))) + 17) + 5 = ((10 * (6 / -132)) + 17) + 5 = ((10 * 0) + 17) + 5 = (0 + 17) + 5 = 17 + 5 = 22
2. 题解
2.1 结题思路
根据队列的数据结构,后进先出。如果遇到相应的二元运算符c,将前面最近的两个数字a、b运算,并将abc及时出队列。图示如下,
图1. 队列后进先出运算
2.2 代码
代码如下,
class Solution(object):
def evalRPN(self, tokens):
"""
:type tokens: List[str]
:rtype: int
"""
while len(tokens) != 1:
for i in range(len(tokens)):
if i >= 2 and tokens[i] == "+":
r = int(tokens[i-2]) + int(tokens[i-1])
tokens.pop(i)
tokens.pop(i-1)
tokens.pop(i-2)
tokens.insert(i-2, r)
break
elif i >= 2 and tokens[i] == "-":
r = int(tokens[i-2]) - int(tokens[i-1])
tokens.pop(i)
tokens.pop(i-1)
tokens.pop(i-2)
tokens.insert(i-2, r)
break
elif i >= 2 and tokens[i] == "*":
r = int(tokens[i-2]) * int(tokens[i-1])
tokens.pop(i)
tokens.pop(i-1)
tokens.pop(i-2)
tokens.insert(i-2, r)
break
elif i >= 2 and tokens[i] == "/":
r = int(int(tokens[i-2]) / int(tokens[i-1]))
tokens.pop(i)
tokens.pop(i-1)
tokens.pop(i-2)
tokens.insert(i-2, r)
break
r = tokens[0]
return r
if __name__ == '__main__':
sol = Solution()
t = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
r = sol.evalRPN(t)
print(r)
但是奇怪的是,我在pycharm运行该示例时,结果为22,正确;但是一样的代码,放到网站上运行就不对了,为啥?