[LeetCode] 772. Basic Calculator III

最新推荐文章于 2023-12-24 21:14:12 发布

haozhugogo

最新推荐文章于 2023-12-24 21:14:12 发布

阅读量2.4k

点赞数

分类专栏：算法 LeetCode

算法同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

LeetCode

7 篇文章 0 订阅

订阅专栏

本文介绍了一种不使用内置eval函数的基本计算器实现方法，通过解析表达式字符串，处理括号、四则运算及整数除法，确保所有计算结果在[-2^31, 2^31-1]范围内。文章提供了详细的解决方案，包括使用栈来存储中间结果，以及递归处理括号内的表达式。

摘要由CSDN通过智能技术生成

https://segmentfault.com/a/1190000016429789?utm_source=tag-newest

Problem

Implement a basic calculator to evaluate a simple expression string.

The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces .

The expression string contains only non-negative integers, +, -, *, / operators , open ( and closing parentheses ) and empty spaces . The integer division should truncate toward zero.

You may assume that the given expression is always valid. All intermediate results will be in the range of [-2147483648, 2147483647].

Some examples:

"1 + 1" = 2
" 6-4 / 2 " = 4
"2*(5+5*2)/3+(6/2+8)" = 21
"(2+6* 3+5- (3*14/7+2)*5)+3"=-12

Note: Do not use the eval built-in library function.

个人总结：

其实把所有的计算都看成加法，无非是加正数，加负数的问题。遇到乘除法我们就原地计算成一个新的被加数。遇到括弧就原地递归得出一个新的被加数。

Solution

class Solution {
    public int calculate(String s) {
        s = s.replaceAll(" ", "");
        if (s.length() == 0) return 0;
        Stack<Integer> stack = new Stack<>();
        char sign = '+';
        int res = 0, pre = 0, i = 0;
        while (i < s.length()) {
            char ch = s.charAt(i);
            //consecutive digits as a number, save in `pre`
            if (Character.isDigit(ch)) {
                pre = pre*10+(ch-'0');
            }
            //recursively calculate results in parentheses
            if (ch == '(') {
                int j = findClosing(s.substring(i));
                pre = calculate(s.substring(i+1, i+j));
                i += j;
            }
            //for new signs, calculate with existing number/sign, then update number/sign
            if (i == s.length()-1 || !Character.isDigit(ch)) {
                switch (sign) {
                    case '+':
                        stack.push(pre); break;
                    case '-':
                        stack.push(-pre); break;
                    case '*':
                        stack.push(stack.pop()*pre); break;
                    case '/':
                        stack.push(stack.pop()/pre); break;
                }
                pre = 0;
                sign = ch;
            } 
            i++;
        }
        while (!stack.isEmpty()) res += stack.pop();
        return res;
    }
    
    //Eliminate all "()" pairs, calculate the result in between and save in `pre`
    private int findClosing(String s) {
        int level = 0, i = 0;
        for (i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '(') level++;
            else if (s.charAt(i) == ')') {
                level--;
                if (level == 0) break;
            } else continue;
        }
        return i;
    }
}