[Leetcode] 150. Evaluate reverse Polish notation inverse 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.

Note:

• Division between two integers shoshould truncate toward zero.
• The given RPN expression is always valid. That means the expression wocould always evaluate to a result and there won't be any divide by zero operation.

Example 1:

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

 

Ideas

I wocould use stack to help solving this problem

Traverse the whole given String Array

1. If operand is integer, push into Stack

2. If operand is operation, pop two items from Stack, do caculation and push result back to stack

 

Code

 1 class Solution { 2     public int evalRPN(String[] tokens) { 3         Stack<Integer> stack = new Stack<>(); 4         for (String s : tokens) { 5             if(s.equals("+")) { 6                 stack.push(stack.pop()+stack.pop()); 7             }else if(s.equals("/")) { 8                 int latter = stack.pop(); 9                 int former = stack.pop();10                 stack.push( former / latter);11             }else if(s.equals("*")) {12                 stack.push(stack.pop() * stack.pop());13             }else if(s.equals("-")) {14                 int latter = stack.pop();15                 int former = stack.pop();16                 stack.push(former - latter);17             }else {18                 stack.push(Integer.parseInt(s));19             }20         }    21         return stack.pop(); 22     }23 }

 

[Leetcode] 150. Evaluate reverse Polish notation inverse Polish notation