Java 實例 - 利用堆疊將中綴表達式轉換成後綴表達式

以下實例示範如何使用堆疊進行表達式的堆疊將中綴（Infix）表達式轉換成後綴（postfix）表達式：

/*
 author by w3cschool.cc
 InToPost.java
 */import java.io.IOException;public class InToPost {
   private Stack theStack;
   private String input;
   private String output = "";
   public InToPost(String in) {
      input = in;
      int stackSize = input.length();
      theStack = new Stack(stackSize);
   }
   public String doTrans() {
      for (int j = 0; j < input.length(); j++) {
         char ch = input.charAt(j);
         switch (ch) {
            case &#39;+&#39;: 
            case &#39;-&#39;:
            gotOper(ch, 1); 
            break; 
            case &#39;*&#39;: 
            case &#39;/&#39;:
            gotOper(ch, 2); 
            break; 
            case &#39;(&#39;: 
            theStack.push(ch);
            break;
            case &#39;)&#39;: 
            gotParen(ch); 
            break;
            default: 
            output = output + ch; 
            break;
         }
      }
      while (!theStack.isEmpty()) {
         output = output + theStack.pop();
      }
      System.out.println(output);
      return output; 
   }
   public void gotOper(char opThis, int prec1) {
      while (!theStack.isEmpty()) {
         char opTop = theStack.pop();
         if (opTop == &#39;(&#39;) {
            theStack.push(opTop);
            break;
         }
         else {
            int prec2;
            if (opTop == &#39;+&#39; || opTop == &#39;-&#39;)
            prec2 = 1;
            else
            prec2 = 2;
            if (prec2 < prec1) { 
               theStack.push(opTop);
               break;
            }
            else
            output = output + opTop;
         }
      }
      theStack.push(opThis);
   }
   public void gotParen(char ch){ 
      while (!theStack.isEmpty()) {
         char chx = theStack.pop();
         if (chx == &#39;(&#39;) 
         break; 
         else
         output = output + chx; 
      }
   }
   public static void main(String[] args) 
   throws IOException {
      String input = "1+2*4/5-7+3/6";
      String output;
      InToPost theTrans = new InToPost(input);
      output = theTrans.doTrans(); 
      System.out.println("Postfix is " + output + &#39;\n&#39;);
   }
   class Stack {
      private int maxSize;
      private char[] stackArray;
      private int top;
      public Stack(int max) {
         maxSize = max;
         stackArray = new char[maxSize];
         top = -1;
      }
      public void push(char j) {
         stackArray[++top] = j;
      }
      public char pop() {
         return stackArray[top--];
      }
      public char peek() {
         return stackArray[top];
      }
      public boolean isEmpty() {
         return (top == -1);
     }
   }}

以上程式碼運行輸出結果為：

124*5/+7-36/+Postfix is 124*5/+7-36/+

以上就是Java 以上程式碼運行輸出結果為利用堆疊將中綴表達式轉換成後綴表達式的內容，更多相關內容請關注PHP中文網（www.php.cn）！