面试题 16.26. 计算器
思路:
先看错误答案:
public int calculate(String s) {
Stack<Integer> stack = new Stack<>();
char sign = ' ';
int i = 0;
int res = 0;
while(i < s.length()){
while(i < s.length() && Character.isDigit(s.charAt(i))){
res = res*10 + (s.charAt(i++) - '0');
}
if (i == s.length() || (!Character.isDigit(s.charAt(i)) && s.charAt(i) != ' ')) {
if (sign == '+')
stack.push(stack.pop() + res);
else if (sign == '-')
stack.push(stack.pop() - res);
else if (sign == '*')
stack.push(stack.pop() * res);
else if (sign == '/')
stack.push(stack.pop() / res);
else
stack.push(res);
res = 0;
if(i < s.length()) sign = s.charAt(i++);
}
}
return stack.pop();
}
遇到这种题目用栈是没错,但是如果像我这样每次遇到一个数就计算结果的话,优先级就没有被考虑到,比如2+3×2就被算成10,显然是不对的,所以应该把有优先级的运算先计算了然后放入栈中,最后累加栈里所有的数:
public int calculate(String s) {
Stack<Integer> stack = new Stack<>();
char opt = '+';
int num = 0;
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (Character.isDigit(ch)) num = num * 10 + (ch - '0');
if ((!Character.isDigit(ch) && ch != ' ') || i == s.length() - 1) {
if (opt == '+')
stack.push(num);
else if (opt == '-')
stack.push(-num);
else if (opt == '*')
stack.push(stack.pop() * num);
else
stack.push(stack.pop() / num);
num = 0;
opt = ch;
}
}
int res = 0;
while (!stack.isEmpty()) res += stack.pop();
return res;
}