Evaluate Reverse Polish Notation

最新推荐文章于 2022-03-25 16:52:08 发布

荔枝树_12w

最新推荐文章于 2022-03-25 16:52:08 发布

阅读量484

点赞数

本文链接：https://blog.csdn.net/news12w/article/details/23311663

版权

C++ 同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

LeetCode OJ 解题笔记

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

逆波兰表达式是一个经典的堆栈数据结构例程。

用stack容器适配器来完成堆栈操作，注意 “-” 与 “-n” 的区别。

class Solution {
public:
    int evalRPN(vector<string> &tokens)
    {
      stack<int> intstack;
      for(int i = 0; i < tokens.size(); i++)
      {
        istringstream iss(tokens[i]);
        int num;
        char ch = tokens[i][0];
        if((ch == '-' && (tokens[i].size() != 1)) || isdigit(ch))
        {
          iss >> num;
          intstack.push(num);
        }
        else
        {
          int a, b;
          a = intstack.top();
          intstack.pop();
          b = intstack.top();
          intstack.pop();
          int c;
          switch(ch)
          {
            case '+':
              c = a + b;
              break;
            case '-':
              c = b - a;
              break;
            case '*':
              c = a * b;
              break;
            case '/':
              c = b / a;
              break;
            default:
              break;
          }
          intstack.push(c);
        }
      }
    
      return intstack.top();
    }

};