Leetcode在线编程evaluate-reverse-polish-notation
题目链接
evaluate-reverse-polish-notation
题目描述
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
题意
给出对应的后缀表达式,计算出得数
解题思路
后缀表达式当然考虑利用栈了,每次遇到操作符,就pop()出2个栈顶的元素进行计算,并将计算结果放入栈中,一直到后缀表达式结束,这时栈顶元素就是后缀表达式的值了
eg:
2 (push) 1(push) + 1(pop) 2(pop) 1+2=3(push) …
因为题目的vector是字符串的,所以这时偷懒使用了stringstream字符流去将字符串转换成对应的整数
介绍一下简单用法
int num;
string s;
stringstream ss;
ss <
AC代码
class Solution {
public:
int evalRPN(vector<string> &tokens) {
stack<int> sta;
for(int i = 0 ; i < tokens.size(); i++)
{
string tmp = tokens.at(i);
if(tmp.length()==1&&(tmp.at(0)< '0'||tmp.at(0) >'9'))
{
int num1 = sta.top();
sta.pop();
int num2 = sta.top();
sta.pop();
if(tmp=="+")
{
sta.push(num2+num1);
}
else if(tmp=="-")
{
sta.push(num2-num1);
}
else if(tmp=="*")
{
sta.push(num2*num1);
}
else if(tmp=="/")
{
sta.push(num2/num1);
}
}
else
{
int num;
stringstream ss;
ss << tmp;
ss >> num;
sta.push(num);
}
}
return sta.top();
}
};