后缀表达式计算-栈的应用

规则：
1.从左到右遍历表达式中的每个数字和符号，如果是数字就进栈，如果是符号，就将处于栈顶的两个数字出栈，一直到运行遇到最后一个符号为止。因为是后缀表达式表达式最后一定是符号。

import java.util.ArrayList;
import java.util.Stack;


public class Calculate {
    private static String list1;
    private static Stack<String> stack = new Stack<String>();
    public Calculate (String list){
        this.list1 = list;
    }
    private static void doInoput(){
        String cal = list1;
        String [] result = list1.split(" ");//以空格为截断，存入数组
        for(String s : result ){
            if(s.equals("+")||s.equals("-")||s.equals("*")||s.equals("/")){
                String rightValue = stack.pop();
                String leftValue = stack.pop();
                int left = Integer.parseInt(leftValue);
                int right = Integer.parseInt(rightValue);
                switch (s) {
                case "+":
                            System.out.println(left+right);
                            stack.push(String.valueOf(left+right));
                    break;
                case "-":
                    System.out.println(left-right);
                    stack.push(String.valueOf(left-right));
                    break;
                case "*":
                    System.out.println(left*right);
                    stack.push(String.valueOf(left*right));
                    break;
                case "/":
                    System.out.println(left/right);
                    stack.push(String.valueOf(left/right));
                    break;
                default:
                    break;
                }
            }else{
                stack.push(s);
            }
        }

    }
    public static void main(String[] args) {
        Calculate c1 =new Calculate("18 3 1 - 3 * + 10 2 / +");
        doInoput();
    }

}