数据结构与算法Java版--中缀转后缀

本系列博客源自学习《尚硅谷数据结构与算法》的学习随笔。

package test.learn.algorithm.PolandNotation;

public class Operation {
    private static int ADD = 1;
    private static int SUB = 1;
    private static int MUL = 2;
    private static int DIV = 2;

    //返回优先级的算法
    public static int getValue(String operation){
        int result = 0;
        switch (operation){
            case"+":
                result = ADD;
                break;
            case"-":
                result = SUB;
                break;
            case"*":
                result = MUL;
                break;
            case"/":
                result = DIV;
                break;
            default:
                System.out.println("没有该运算符");
                break;
        }
        return result;
    }
}

    package test.learn.algorithm.PolandNotation;

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

    public class poland {
        public static void main(String[] args) {
            //将中缀表达式以集合的形式存储
            String expression = "1+((2+3)*4)-5";
            //String expression = "4 5 * 8 - 60 + 8 2 / +";
            List<String> list = toList(expression);
            System.out.println(list);
            //将中缀表达式转换成后缀表达式
            List<String> list1 = zhongTOhou(list);
            System.out.println(list1);
            //后缀表达式的计算结果
            System.out.println(calculate(list1));
        }
        //将逆波兰式传入一个数组之中
        public static List<String> getList(String express){
            String [] spilt = express.split(" ");
            List<String> list = new ArrayList<String>();
            for (String s : spilt) {
                list.add(s);
            }
            //System.out.println(list);
            return list;
        }
        //将中缀表达式转换成对应的集合
        public static List<String> toList(String express){//1+((2+3)x4)-5
            // 定义一个list用来存放中缀表达式的内容
            List<String> list = new ArrayList<String>();
            int i = 0;//用于遍历
            String str = "";//用于多位数的拼接
            char c;//用于扫描字符
            do{
                c = express.charAt(i);
               if(c<48||c>57){
                   list.add(""+c);
                   i++;
               }else{
                   while(i<express.length() && express.charAt(i)>=48 && express.charAt(i)<=57){
                       str+=express.charAt(i);
                       i++;
                   }
                   list.add(str);
                   str = "";
               }
            }while(i<express.length());
            return list;
        }
        //将中缀表达式转换成后缀表达式
        public static List<String> zhongTOhou(List<String> list){
            //定义一个符号栈
            Stack<String> stack = new Stack<String>();
            //定义一个list存储中间结果
            List<String> list1 = new ArrayList<String>();
            //遍历
            for (String s : list) {
                if(s.matches("\\d+")){
                    list1.add(s);
                }else if(s.equals("(")){
                    stack.push(s);
                }else if(s.equals(")")){
                    while(!stack.peek().equals("(")){
                        list1.add(stack.pop());
                    }
                    stack.pop();
                }else{
                    //当s的优先级低于栈顶的时候，栈顶元素弹出
                    while(stack.size()>0 && Operation.getValue(stack.peek())>=Operation.getValue(s)){
                        list1.add(stack.pop());
                    }
                    stack.push(s);
                }
            }
            while (stack.size()!=0){
                list1.add(stack.pop());
            }
            return list1;
        }
        //完成对逆波兰式的扫描
        public static int calculate(List<String> list){
            Stack<String> stack = new Stack<String>();
            for (String l : list) {
                if(l.matches("\\d+")){
                    stack.push(l);
                }else{
                    //弹出两个数
                    int num1 = Integer.parseInt(stack.pop());
                    int num2 = Integer.parseInt(stack.pop());
                    int res = 0;
                    switch (l){
                        case"+":
                            res = num1+num2;
                            break;
                        case"-":
                            res = num2-num1;
                            break;
                        case"/":
                            res =num2/num1;
                            break;
                        case"*":
                            res =num1*num2;
                            break;
                        default:
                            break;
                    }
                    stack.push(""+res);
                }
            }
            return Integer.parseInt(stack.pop());
        }
    }

结果展示：