栈-运算后缀表达式

package c_stack.D_postfix;


public class ParsePost {
private StackX theStackX;
private String input;


public ParsePost(String s) {
input = s;
}


public int doParse() {
int result;
theStackX = new StackX(20);
/**
* 判断是否是数，是则入栈。判断是否是操作符，是则弹出2个数，进行运算。
*/
for (int i = 0; i < input.length(); i++) {
char ch = input.charAt(i);
if (ch >= '0' && ch <= '9') {
theStackX.push((int) (ch - '0'));// 转换成int
} else {
int num2 = theStackX.pop();
int num1 = theStackX.pop();


switch (ch) {
case '+':
result = num1 + num2;
break;
case '-':
result = num1 - num2;
break;
case '*':
result = num1 * num2;
break;
case '/':
result = num1 / num2;
break;
default:
result = 0;
break;
}
System.out.println(result);
theStackX.push(result);
}
}
return theStackX.pop();
}
}package c_stack.D_postfix;


/**
 * 运算后缀表达式
 * @author Administrator
 *
 */
public class PostfixApp {
public static void main(String[] args) {
String input = "34+62/6341-*+*-";
//3 + 4 - 6 / 2 * (6 + 3 * (4 - 1));
ParsePost p = new ParsePost(input);
int result = p.doParse();
System.out.println(result);
}
}package c_stack.D_postfix;


public class StackX {
private int arr[];
private int top;
private int maxSize;


public StackX(int s) {
maxSize = s;
arr = new int[maxSize];
top = -1;
}


public void push(int key) {
arr[++top] = key;


}


public int pop() {
return arr[top--];
}


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


public int peekN(int n) {
return arr[n];
}


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


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


public int size() {
return top + 1;
}


}