## 一、后缀表达式的计算方法 ##
- 给出一个算式,如:(3 * 4-(2+5)) * 4 / 2,其等价的后缀表达式为:3 4 * 2 5 + - 4 * 2 /;计算方法为从左到右扫描后缀表达式,遇到数字则入栈,遇到运算符则将栈中的数字出栈,第一个出栈的数字充当第二个运算数,第二个出栈的数字充当第一个运算数,与运算符作运算,并将结果入栈,最后栈中剩下的那个数就是运算结果。
二、代码实现
- PostfixTester.java
import java.util.Scanner;
public class PostfixTester {
/**
* @param args
*/
public static void main(String[] args) {
String expression, again;
int result;
Scanner in = new Scanner(System.in);
do {
PostfixEvaluator evaluator = new PostfixEvaluator();
System.out.println("请输入一个后缀表达式,用空格隔开");
System.out.println("比如:5 4 + 3 2 1 - + *");
expression = in.nextLine();
result = evaluator.evaluate(expression);
System.out.println("结果为:"+result);
System.out.println("还要继续吗[Y/N]?");
again = in.nextLine();
} while (again.equalsIgnoreCase("y"));
}
}
- PostfixEvaluator.java
import java.util.Scanner;
import java.util.Stack;
public class PostfixEvaluator {
private final static char ADD = '+';
private final static char SUBTRACT = '-';
private final static char MULTIPLY = '*';
private final static char DEVIDE = '/';
private Stack<Integer> stack;
public PostfixEvaluator() {
stack = new Stack<>();
}
public int evaluate(String expr) {
int op1, op2, result = 0;
String token;
Scanner parser = new Scanner(expr);
while (parser.hasNext()) {
token = parser.next();
//判断是否为运算符
if (isOperator(token)) {
//栈中数据类型为Integer,要转换为int
op2 = (stack.pop()).intValue();
op1 = (stack.pop()).intValue();
result = evaluateSingleOprator(token.charAt(0), op1, op2);
stack.push(new Integer(result));
} else {
stack.push(new Integer(Integer.parseInt(token)));
}
}
return result;
}
private int evaluateSingleOprator(char operation, int op1, int op2) {
int result = 0;
switch (operation) {
case ADD:
result = op1 + op2;
break;
case SUBTRACT:
result = op1 - op2;
break;
case MULTIPLY:
result = op1 * op2;
break;
case DEVIDE:
result = op1 / op2;
break;
}
return result;
}
private boolean isOperator(String token) {
return (token.equals("+") || token.equals("-") || token.equals("*") || token
.equals("/"));
}
}