LeetCode150：Evaluate Reverse Polish Notation

最新推荐文章于 2024-11-02 16:53:29 发布

diehuojiang5959

最新推荐文章于 2024-11-02 16:53:29 发布

阅读量74

点赞数

文章标签：数据结构与算法 c/c++

原文链接：http://www.cnblogs.com/mickole/p/3669600.html

版权

本文介绍了一种使用栈来解决逆波兰表达式求值问题的方法。通过遍历表达式的每个元素，判断其是否为运算符，若是则从栈中取出两个操作数进行运算，并将结果压回栈中，直至遍历结束，最后栈顶元素即为表达式的值。文中给出了详细的C++代码实现。

摘要由CSDN通过智能技术生成

题目：

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

解题思路：

很简单的一题，直接利用栈实现，不多说了

实现代码：

#include <iostream>
#include <stack>
#include <vector>
#include <string>
#include <cstdlib> 
using namespace std;

/*
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<string> operand_stack;
        vector<string>::iterator iter;
        for(iter = tokens.begin(); iter != tokens.end(); ++iter)
        {
            if(*iter == "+")//这里就不提取重复代码了，直接简单点 
            {
                string op1 = operand_stack.top();
                operand_stack.pop();
                string op2 = operand_stack.top();
                operand_stack.pop();
                //int ret = atoi(op2.c_str()) + atoi(op1.c_str());
                int ret = stoi(op2) + stoi(op1);//stoi为C++11才有 
                string result = to_string(ret);
                operand_stack.push(result);
                
            }
            else if(*iter == "-")
            {
                string op1 = operand_stack.top();
                operand_stack.pop();
                string op2 = operand_stack.top();
                operand_stack.pop();
                int ret = atoi(op2.c_str()) - atoi(op1.c_str());
                string result = to_string(ret);
                operand_stack.push(result);
                
            }
            else if(*iter == "*")
            {
                string op1 = operand_stack.top();
                operand_stack.pop();
                string op2 = operand_stack.top();
                operand_stack.pop();
                int ret = atoi(op2.c_str()) * atoi(op1.c_str());
                string result = to_string(ret);
                operand_stack.push(result);
                
            }
            else if(*iter == "/")
            {
                string op1 = operand_stack.top();
                operand_stack.pop();
                string op2 = operand_stack.top();
                operand_stack.pop();
                if( atoi(op1.c_str()) == 0)
                    return 0x7FFFFFF;
                int ret = atoi(op2.c_str()) / atoi(op1.c_str());
                string result = to_string(ret);
                operand_stack.push(result);
                
            }
            else
                operand_stack.push(*iter);
        }
        return atoi(operand_stack.top().c_str());
    
    }
 
};

int main(void)
{
    string strs[] = {"4", "13", "5", "/", "+"};
    vector<string> tokens(strs, strs+5);
    Solution solution;
    int ret = solution.evalRPN(tokens);
    cout<<ret<<endl;
    return 0;
}