在韩顺平老师的数据结构课程P35中代码实测出现了问题,无法处理如7-3*5+2此类高级运算符前面跟着个-的情况,按照老师的代码3*5=15之后会继续和+2进行运算最后结果为7-17=-10,而正确结果为-6,在此我尝试解决这个问题
代码如下:
import java.util.Scanner;
import java.util.Stack;
public class Calculator {
public static void main(String[] args) {
Stack<Double> num = new Stack<>();
Stack<Character> sign = new Stack<>();
Scanner sc = new Scanner(System.in);
System.out.println("请输入要计算的算式");
String inp = sc.next();
//提取算式中的元素放入栈中
double temp = 0;
for (int i = 0; i < inp.length(); i++) {
char x1 = inp.charAt(i);
if (x1 >= '0' && x1 <= '9') {
temp = temp * 10 + x1 - '0';
if (i == inp.length() - 1) {
num.push(temp);
}
} else { //处理字符的情况
num.push(temp);
temp = 0;
if (sign.empty()) { // 如果是空的话直接放进去
sign.push(x1);
} else { //不是空的话就需要判断一下
char tempSign = sign.pop();
if (level(x1,tempSign)) {
sign.push(tempSign);
sign.push(x1);
} else { //这里注意一下,栈中符号最多存储两层,此时直接计算完,可以用peek
double a = num.pop();
double b = num.pop();
num.push(simpleCal(b,a,tempSign));
if (!sign.empty()) {
if (!level(x1,sign.peek())) {
a = num.pop();
b = num.pop();
num.push(simpleCal(b,a,sign.pop()));
}
}
sign.push(x1);
}
}
}
} //循环结束之后,栈中一定还剩下一些东西
while(!sign.empty()) {
double t1 = num.pop();
double t2 = num.pop();
char t3 = sign.pop();
num.push(simpleCal(t2,t1,t3));
}
System.out.println(num.pop());
}
public static double simpleCal(double a, double b, char sign) {
double res = 0;
switch (sign) {
case '+' :
res = a + b;
break;
case '-' :
res = a - b;
break;
case '*' :
res = a * b;
break;
case '/' :
res = a * 1.0 / b;
break;
}
return res;
}
public static boolean level(char a,char b) {
//若a的优先级比b大,那么返回true,若小于等于b,则返回false
boolean flag = false;
if ((a == '*' || a == '/') && (b == '+' || b == '-')) {
flag = true;
}
return flag;
}
}
只需要在7-3*5+2的乘法判断完之后,紧接上-和+的判断,便可以解决问题
其实一开始我还在想是否应该用递归来解决这个问题,当栈中有多层数据的时候使用递归解决,但是觉得并不需要这么麻烦,因为符号位最多只能堆积两层。
但是显然在出现括号时使用递归是非常方便的办法,识别到'('进入递归,识别到')'退出即可
以下是包含括号在内的计算器代码,其他地方大体不变,只需要在判断数字的地方加入递归运算即可
public static double calculate(String inp) {
Stack<Double> num = new Stack<>();
Stack<Character> sign = new Stack<>();
//提取算式中的元素放入栈中
double temp = 0;
for (int i = 0; i < inp.length(); i++) {
char x1 = inp.charAt(i);
if (x1 >= '0' && x1 <= '9' || x1 == '(') {
if (x1 == '(') {
int end = i+1;
int n = 1; //记录出现的左括号数
for (int j = i+1; j < inp.length(); j++) {
if (inp.charAt(j) == '(') {
n++;
}
if (inp.charAt(j) == ')') {
n--;
if (n == 0) {
end = j;
break;
}
}
}
temp = calculate(inp.substring(++i,end));
i = end;
} else {
temp = temp * 10 + x1 - '0';
}
if (i == inp.length() - 1) {
num.push(temp);
}
} else { //处理字符的情况
num.push(temp);
temp = 0;
if (sign.empty()) { // 如果是空的话直接放进去
sign.push(x1);
} else { //不是空的话就需要判断一下
char tempSign = sign.pop();
if (level(x1,tempSign)) {
sign.push(tempSign);
sign.push(x1);
} else { //这里注意一下,栈中符号最多存储两层,此时直接计算完,可以用peek
double a = num.pop();
double b = num.pop();
num.push(simpleCal(b,a,tempSign));
if (!sign.empty()) {
if (!level(x1,sign.peek())) {
a = num.pop();
b = num.pop();
num.push(simpleCal(b,a,sign.pop()));
}
}
sign.push(x1);
}
}
}
} //循环结束之后,栈中一定还剩下一些东西
while(!sign.empty()) {
double t1 = num.pop();
double t2 = num.pop();
char t3 = sign.pop();
num.push(simpleCal(t2,t1,t3));
}
return num.pop();
}
public static double simpleCal(double a, double b, char sign) {
double res = 0;
switch (sign) {
case '+' :
res = a + b;
break;
case '-' :
res = a - b;
break;
case '*' :
res = a * b;
break;
case '/' :
res = a * 1.0 / b;
break;
}
return res;
}
public static boolean level(char a,char b) {
//若a的优先级比b大,那么返回true,若小于等于b,则返回false
boolean flag = false;
if ((a == '*' || a == '/') && (b == '+' || b == '-')) {
flag = true;
}
return flag;
}
}