Evaluate Reverse Polish Notation Problem


Description

LeetCode Problem 150.

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, and /. Each operand may be an integer or another expression.

Note that division between two integers should truncate toward zero.

It is guaranteed that the given RPN expression is always valid. That means the expression would always evaluate to a result, and there will not be any division by zero operation.

Example 1:

1
2
3
Input: tokens = ["2","1","+","3","*"]
Output: 9
Explanation: ((2 + 1) * 3) = 9

Example 2:

1
2
3
Input: tokens = ["4","13","5","/","+"]
Output: 6
Explanation: (4 + (13 / 5)) = 6

Example 3:

1
2
3
4
5
6
7
8
9
Input: tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
Output: 22
Explanation: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

Constraints:

  • 1 <= tokens.length <= 10^4
  • tokens[i] is either an operator: “+”, “-“, “*”, or “/”, or an integer in the range [-200, 200].


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> st;
        int i = 0, num1, num2;
        while (i < tokens.size()) {
            if (tokens[i] == "+" || 
                tokens[i] == "-" || 
                tokens[i] == "*" || 
                tokens[i] == "/") {
                num2 = st.top();
                st.pop();
                num1 = st.top();
                st.pop();
                if (tokens[i] == "+")
                    st.push(num1 + num2);
                if (tokens[i] == "-")
                    st.push(num1 - num2);
                if (tokens[i] == "*")
                    st.push(num1 * num2);
                if (tokens[i] == "/")
                    st.push(num1 / num2);
            } else {
                st.push(stoi(tokens[i]));
            }
            i ++;
        }
        return st.top();
    }
};




Related Posts

Min Stack Problem

LeetCode 155. Design a stack that supports push, pop, top,...

Binary Search Tree Iterator Problem

LeetCode 173. Implement the BSTIterator class that represents an iterator...

Evaluate Reverse Polish Notation Problem

LeetCode 150. Evaluate the value of an arithmetic expression in...

Maximal Rectangle Problem

LeetCode 85. Given a rows x cols binary matrix filled...

Largest Rectangle in Histogram Problem

LeetCode 84. Given an array of integers heights representing the...

Simplify Path Problem

LeetCode 71. Given a string path, which is an absolute...