Evaluate Reverse Polish Notation问题及解法

最新推荐文章于 2019-12-02 11:24:54 发布

我们要爱学习

最新推荐文章于 2019-12-02 11:24:54 发布

阅读量243

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77198634

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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

问题分析：

题意要求根据逆波兰表达式求得该表达式的值，我们知道逆波兰表达式一般用栈进行操作。

过程详见代码：

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        vector<string> stack;
		for (int i = 0; i < tokens.size(); i++)
		{
			if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/")
			{
				int a = stoi(stack.back());
				stack.pop_back();
				int b = stoi(stack.back());
				stack.pop_back();
				if (tokens[i] == "+") stack.emplace_back(to_string(b + a));
				if (tokens[i] == "-") stack.emplace_back(to_string(b - a));
				if (tokens[i] == "*") stack.emplace_back(to_string(b * a));
				if (tokens[i] == "/") stack.emplace_back(to_string(b / a));
			}
			else 
			{
				stack.emplace_back(tokens[i]);
			}
		}
		return stoi(stack.back());
    }
};