0
我想制作逆波兰表示法算法,但是我的代码不工作。任何人都能解释我为什么? 在我的代码中,我想采取字符,直到“/ + - *”标记。如果这个令牌是下一个操作,那就包含在case中。逆波兰表示法Java
import java.util.Stack;
import java.util.StringTokenizer;
import javax.swing.JOptionPane;
public class ONP {
public static void main(String[] args) {
Stack<Double> stack = new Stack<Double>();
double number1;
double number2;
String x = JOptionPane.showInputDialog("Tokens");
StringTokenizer str = new StringTokenizer(x);
while (str.hasMoreElements()) {
str.nextElement();
stack.push((Double) str.nextElement());
for (int i = 0; i < x.length(); i++) {
switch (x.charAt(i)) {
case '+':
number1 = stack.pop();
number2 = stack.pop();
System.out.println(number1 + number2);
break;
case '-':
number1 = stack.pop();
number2 = stack.pop();
System.out.println(number1 - number2);
break;
case '/':
number1 = stack.pop();
number2 = stack.pop();
System.out.println(number1/number2);
break;
case '*':
number1 = stack.pop();
number2 = stack.pop();
System.out.println(number1 * number2);
break;
}
}
System.out.println(stack.pop());
}
}
}
我想写它没有StringBuilder或者那样。
输入:
2 2 + 2/2/
输出:
(2+2)/2/2