用栈实现中缀表达式

package ArrayStack;

public class ArrayStackDemo {
    public static void main(String[] args) {
        String exp = "70+20*6-4";
        ArrayStack numStack = new ArrayStack(10);
        ArrayStack operstack = new ArrayStack(10);

        int index = 0;
        int num1 = 0;
        int num2 = 0;
        int oper = 0;
        int res = 0;
        char ch = ' ';
        String keepNum = "";//用于拼接多位数
        while (true) {
            ch = exp.substring(index, index + 1).charAt(0);
            if (operstack.isOper(ch)) {
                if (!operstack.isEmpty()) {
                    if (operstack.priority(ch) <= operstack.priority(operstack.peek())) {
                        num1 = numStack.pop();
                        num2 = numStack.pop();
                        oper = operstack.pop();
                        res = numStack.cal(num1, num2, oper);
                        numStack.push(res);
                        operstack.push(ch);
                    } else {
                        operstack.push(ch);
                    }
                } else {
                    operstack.push(ch);
                }
            } else {
               // numStack.push(ch-48);
                keepNum += ch;
                if(index == exp.length()-1){
                    numStack.push(Integer.parseInt(keepNum));//字符串转为int类型
                }else {
                    if (operstack.isOper(exp.substring(index + 1, index + 2).charAt(0))) {
                        numStack.push(Integer.parseInt(keepNum));//字符串转为int类型
                        keepNum = "";
                    }
                }
            }
            index++;
            if (index >= exp.length()) {
                break;
            }
        }

        while (true) {
            if (operstack.isEmpty()) {
                break;
            }
            num1 = numStack.pop();
            num2 = numStack.pop();
            oper = operstack.pop();
            res = numStack.cal(num1, num2, oper);
            numStack.push(res);
        }
        System.out.println("表达式" + exp + "的结果为：" + numStack.pop());
    }
}

class ArrayStack {
    private int maxSize;
    private int[] stack;
    private int top = -1;

    public ArrayStack(int maxSize) {
        this.maxSize = maxSize;
        stack = new int[this.maxSize];
    }

    public boolean isFull() {
        return top == maxSize - 1;
    }

    public boolean isEmpty() {
        return top == -1;
    }

    public void push(int value) {
        if (isFull()) {
            System.out.println("栈已满...");
            return;
        }
        this.stack[++top] = value;
    }

    public int pop() {
        if (isEmpty()) {
            System.out.println("栈空");
        }
        return stack[top--];
    }

    //遍历
    public void list() {//
        if (isEmpty()) {
            System.out.println("栈空");
            return;
        }
        for (int i = top; i >= 0; i--) {
            System.out.println(stack[i]);
        }
    }

    //返回运算符的优先级
    public int priority(int oper) {
        if (oper == '*' || oper == '/') {
            return 1;
        } else {
            return 0;
        }
    }

    public boolean isOper(char val) {
        return val == '/' || val == '*' || val == '+' || val == '-';
    }

    public int cal(int n1, int n2, int oper) {
        int res = 0;
        switch (oper) {
            case '+':
                res = n1 + n2;
                break;
            case '-':
                res = n2 - n1;
                break;
            case '*':
                res = n1 * n2;
                break;
            case '/':
                res = n2 / n1;
                break;
        }
        return res;
    }

    public int peek() {
        return stack[top];
    }

}