LeetCode--Evaluate Reverse Polish Notation

最新推荐文章于 2025-05-27 22:27:28 发布

Leon__CAI

最新推荐文章于 2025-05-27 22:27:28 发布

阅读量706

点赞数 1

分类专栏： leetcode 文章标签： leetcode stack 逆波兰数

本文链接：https://blog.youkuaiyun.com/shaya118/article/details/42738595

版权

leetcode 专栏收录该内容

103 篇文章

订阅专栏

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) 
    {
        stack<int> data;
        for(int i=0; i<tokens.size(); i++)
        {
            if(tokens[i]=="+" || tokens[i]=="-" || tokens[i]=="*" || tokens[i]=="/")
			{
				int second = data.top();
				data.pop();
				int first = data.top();
				data.pop();
				if(tokens[i]=="+")
					data.push(first+second);
				else if(tokens[i]=="-")
					data.push(first-second);
				else if(tokens[i]=="*")
					data.push(first*second);
				else
					data.push(first/second);
			}
			else
				data.push(string_to_int(tokens[i]));
        }
		return data.top();
    }
	int string_to_int(string s)
	{
		int res=0;
		int i=0;
		if(s[0] == '-')
			i=1;
		for(;i<s.length(); i++)
			res = res*10 + s[i]-48;
		if(s[0] == '-')
			res = -res;
		return res;
	}
};