LeetCode 227: Basic Calculator II Solution

Master LeetCode problem 227 (Basic Calculator II), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

227. Basic Calculator II

Medium

Math String Stack

Problem Explanation

Explanation

To solve this problem, we can use a stack to keep track of intermediate results while processing the expression from left to right. We iterate over the input string, and for each character, we either push the number onto the stack or perform the operation with the top element(s) on the stack based on the operator. We need to handle multiplication, division, addition, and subtraction with the correct precedence.

Algorithm

Initialize a stack to store intermediate results and a variable num to keep track of the current number being processed.
Iterate over the input string s.
If the current character is a digit, update num accordingly.
If the current character is an operator or we have reached the end of the string, perform the corresponding operation with the top element(s) on the stack based on the operator.
Finally, sum up all elements in the stack to get the final result.

Time Complexity

The time complexity of this algorithm is O(n), where n is the length of the input string s.

Space Complexity

The space complexity is also O(n) due to the stack used to store the intermediate results.

Solution Code

class Solution {
    public int calculate(String s) {
        Stack<Integer> stack = new Stack<>();
        int num = 0;
        char sign = '+';
        
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            
            if (Character.isDigit(c)) {
                num = num * 10 + (c - '0');
            }
            
            if ((!Character.isDigit(c) && c != ' ') || i == s.length() - 1) {
                if (sign == '+') {
                    stack.push(num);
                } else if (sign == '-') {
                    stack.push(-num);
                } else if (sign == '*') {
                    stack.push(stack.pop() * num);
                } else if (sign == '/') {
                    stack.push(stack.pop() / num);
                }
                
                sign = c;
                num = 0;
            }
        }
        
        int result = 0;
        while (!stack.isEmpty()) {
            result += stack.pop();
        }
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 227 (Basic Calculator II)?

This page provides optimized solutions for LeetCode problem 227 (Basic Calculator II) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 227 (Basic Calculator II)?

The time complexity for LeetCode 227 (Basic Calculator II) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 227 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 227 in Java, C++, or Python.

Back to LeetCode Solutions