Leetcode: Evaluate Reverse Polish Notation

最新推荐文章于 2021-03-20 19:59:28 发布

「已注销」

最新推荐文章于 2021-03-20 19:59:28 发布

阅读量2.8k

点赞数

分类专栏： Leetcode 算法与数据结构程序员笔试面试文章标签： Leetcode Reverse Polish Notat

本文链接：https://blog.csdn.net/doc_sgl/article/details/17101519

版权

算法与数据结构同时被 3 个专栏收录

223 篇文章 1 订阅

订阅专栏

程序员笔试面试

223 篇文章 1 订阅

订阅专栏

Leetcode

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

int evalRPN(vector<string> &tokens) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(tokens.size()==1)return stoi(*tokens.begin());
        stack<int> numbers;
		vector<string>::iterator it = tokens.begin();
		int op1 = 0;
		int op2 = 0;
		while(it != tokens.end())
		{
			if(*it == "+"||*it == "-" || *it == "*" || *it == "/")
			{
				op2 = numbers.top();
				numbers.pop();
				op1 = numbers.top();
				numbers.pop();
				if(*it == "+")
					numbers.push(op1+op2);
				else if(*it == "-")
					numbers.push(op1-op2);
				else if(*it == "*")
					numbers.push(op1*op2);
				else
					numbers.push(op1/op2);
			}
			else
				numbers.push(stoi(*it));
			it++;
		}
		return numbers.top();
    }