题目链接:https://leetcode.com/problems/basic-calculator-ii/
题目:
Implement a basic calculator to evaluate a simple expression string.
The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should truncate toward zero.
You may assume that the given expression is always valid.
Some examples:
“3+2*2” = 7
” 3/2 ” = 1
” 3+5 / 2 ” = 5
Note: Do not use the eval built-in library function.
思路:
每到一个数字的时候看看该数字前面的操作符,如果是乘除法则立即计算该操作,并将结果压入栈中;如果是减法则将该数字变为负数并将减法改为加法 ,这样到最后,操作符栈中实际都是加法,就没有优先级的处理问题了,直接计算就能得到结果
算法:
public int calculate(String s) {
Stack<String> operator = new Stack<String>();
Stack<Integer> nums = new Stack<Integer>();
s = s.replace(" ", "");
int curNum = 0; // 连续字符都是数字要组合成一个数
for (int i = 0; i < s.length(); i++) {
char op = s.charAt(i);
if (Character.isDigit(op)) { // 当前是数字
curNum = Integer.parseInt(op + "");
while (i + 1 < s.length() && Character.isDigit(s.charAt(i + 1))) { // 后继字符也是数字,组合成一个数
char nextNum = s.charAt(i + 1);
curNum = curNum * 10 + Integer.parseInt(nextNum + "");
i++;
}// 一个操作数处理完
nums.push(curNum);
if (operator.isEmpty())
continue;
String preOp = operator.pop();
;
if (preOp.equals("*")) {
nums.push(nums.pop() * nums.pop());
} else if (preOp.equals("/")) {
int first = nums.pop();
int second = nums.pop();
nums.push(second / first);
} else if (preOp.equals("-")) {
operator.push("+");
nums.push(-nums.pop());
} else {
operator.push(preOp);
}
if (i + 1 == s.length()) {// 当前操作数是最后一个操作数
while (nums.size() >= 2) {
nums.push(nums.pop() + nums.pop());
}
}
} else { // 当前字符是操作符
operator.push(op + "");
}
}
return nums.pop();
}