文章目錄

• • 數(shù)組模擬棧類
  • 中綴表達(dá)式計算器類（測試類）

---

數(shù)組模擬棧類

主要實(shí)現(xiàn)棧的一些基本功能，以及在該場景下的功能。

//先創(chuàng)建一個棧 class AStack {private int maxSize; //棧的大小private int[] stack; //數(shù)組模擬棧private int top = -1; //棧頂，初始化-1//構(gòu)造器public AStack(int maxSize) {this.maxSize = maxSize;stack = new int[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;}top++;stack[top] = value;}//出棧public int pop(){if (isEmpty()){throw new RuntimeException("棧空，出棧失敗！");}return stack[top--]; //先得到stack[top]，然后top--}//返回棧頂值public int peek(){return stack[top];}//遍歷（從棧頂向下）public void show(){if (isEmpty()){System.out.println("棧空！");return;}for (int i = top; i >= 0; i--) {System.out.printf("stack[%d] = %d\n",i,stack[i]);}}//返回運(yùn)算符優(yōu)先級（約定數(shù)值越大，優(yōu)先級越高）public int priority(char operator){if (operator == '*' || operator == '/'){return 1;}else if (operator == '+' || operator == '-'){return 0;}else return -1; //假設(shè)只有加減乘除}//判斷是不是運(yùn)算符public boolean isOperator(char value){return value == '+' || value == '-' || value == '*' || value == '/';}//兩數(shù)計算方法public int cal(int num1,int num2,char operator){int result = 0; //計算結(jié)果switch (operator){case '+':result = num2 + num1;break;case '-':result = num2 - num1;break;case '*':result = num2 * num1;break;case '/':result = num2 / num1;break;}return result;} }

---

中綴表達(dá)式計算器類（測試類）

主要實(shí)現(xiàn)計算的邏輯。

public class Calculate {public static void main(String[] args) {String expression = "5+40*4-3"; //162AStack numStack = new AStack(10); //數(shù)棧AStack opeStack = new AStack(5); //運(yùn)算符棧//定義需要的變量int index = 0; //用于掃描表達(dá)式int num1 = 0;int num2 = 0;int ope = 0;int res = 0; //用于臨時保存兩數(shù)運(yùn)算結(jié)果char ch = ' '; //每次掃描得到的字符String keepNum = ""; //用于拼接多位數(shù)//掃描表達(dá)式while (true){//掃描一個表達(dá)式字符ch = expression.substring(index,index+1).charAt(0);//判斷ch是數(shù)還是運(yùn)算符，并處理if (opeStack.isOperator(ch)) {//是運(yùn)算符if (opeStack.isEmpty()){//運(yùn)算符棧為空，直接入棧opeStack.push(ch);}else {//不為空if (opeStack.priority(ch) > opeStack.priority((char) opeStack.peek())){//新的運(yùn)算符優(yōu)先級大于棧頂運(yùn)算符的優(yōu)先級，直接入棧opeStack.push(ch);}else {//小于等于，則數(shù)棧pop兩個,運(yùn)算符棧pop一個進(jìn)行運(yùn)算，將結(jié)果入數(shù)棧、新運(yùn)算符入運(yùn)算符棧num1 = numStack.pop();num2 = numStack.pop();ope = opeStack.pop();res = numStack.cal(num1,num2, (char) ope);numStack.push(res);opeStack.push(ch);}}}else {//是數(shù)keepNum += ch;if (index == expression.length() - 1){numStack.push(Integer.parseInt(keepNum));}else {if (numStack.isOperator(expression.substring(index+1,index+2).charAt(0))){//后一位是運(yùn)算符，則當(dāng)前的可以直接入數(shù)棧numStack.push(Integer.parseInt(keepNum));keepNum = ""; //清空}}}index++;if (index >= expression.length()){//掃描到最后break;}}//掃描結(jié)束，就順序pop運(yùn)算符棧和數(shù)棧進(jìn)行運(yùn)算，如何每次將結(jié)果入數(shù)棧while (true){if (opeStack.isEmpty()){//運(yùn)算符棧為空，則運(yùn)算結(jié)束break;}num1 = numStack.pop();num2 = numStack.pop();ope = opeStack.pop();res = numStack.cal(num1,num2, (char) ope);numStack.push(res);}//數(shù)棧最后一個數(shù)即為表達(dá)式結(jié)果System.out.printf("表達(dá)式 %s = %d",expression,numStack.pop());} }

總結(jié)

以上是生活随笔為你收集整理的字符串得结果！Java数组模拟栈以实现中缀表达式综合计算器，字符串表达式计算器的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。