数据结构之java实现逆波兰表达式计算（后缀表达式计算）

package stack;

import java.util.Stack;

public class ReversePolishNotation {
    public static void main(String[] args) {
        //中缀表达式3*（17-15）+18/6的逆波兰表达式如下
        String[] notation = {"3", "17", "15", "-", "*", "18", "6", "/", "+"};
        int result = caculate(notation);
        System.out.println("逆波兰表达式的结果为：" + result);
    }

    public static int caculate(String[] notaion) {
        Stack<Integer> temp = new Stack<>();
        //遍历元素
        for (int i = 0; i < notaion.length; i++) {
            String curr = notaion[i];
            Integer o1;
            Integer o2;
            Integer result;
            switch (curr) {
            //运算符出栈两个变量
                case "+":
                    o1 = temp.pop();
                    o2 = temp.pop();
                    result = o2 + o1;
                    System.out.println(result);
                    temp.push(result);
                    break;
                case "-":
                    o1 = temp.pop();
                    o2 = temp.pop();
                    result = o2 - o1;
                    System.out.println(result);
                    temp.push(result);
                    break;
                case "*":
                    o1 = temp.pop();
                    o2 = temp.pop();
                    result = o2 * o1;
                    System.out.println(result);
                    temp.push(result);
                    break;
                case "/":
                    o1 = temp.pop();
                    o2 = temp.pop();
                    result = o2 / o1;
                    System.out.println(result);
                    temp.push(result);
                    break;
                    //数值入栈
                default:
                    temp.push(Integer.parseInt(curr));
                    break;

            }

        }
        return temp.pop();

    }
}