LeetCode-227. Basic Calculator II [C++][Java]_leetcode227的java版本-CSDN博客

这篇文章讲解了如何使用C++和Java语言实现LeetCode题目227——BasicCalculatorII，通过字符串解析表达式并计算其值，重点介绍了如何处理整数运算和运算符优先级。实例代码展示了如何逐字符遍历，处理加减乘除，并正确处理括号和运算符优先级。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode-227. Basic Calculator IIhttps://leetcode.com/problems/basic-calculator-ii/

Given a string s which represents an expression, evaluate this expression and return its value.

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 [-231, 231 - 1].

Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval().

Example 1:

Input: s = "3+2*2"
Output: 7

Example 2:

Input: s = " 3/2 "
Output: 1

Example 3:

Input: s = " 3+5 / 2 "
Output: 5

Constraints:

1 <= s.length <= 3 * 10^5
s consists of integers and operators ('+', '-', '*', '/') separated by some number of spaces.
s represents a valid expression.
All the integers in the expression are non-negative integers in the range [0, 2^31 - 1].
The answer is guaranteed to fit in a 32-bit integer.

【C++】

class Solution {
public:
    int calculate(string s) {
        int left = 0, right = 0, num = 0;
        char preOp = '+';
        stack<int> st;
        for (int i = 0; i < s.length();) {
            while (i < s.length() && s[i] == ' ') {i++;}
            while (i < s.length() && isdigit(s[i])) {
                num = num * 10 + (s[i++] - '0');
            }
            switch (preOp) {
                case '+': left += right; right = num; num = 0; break;
                case '-': left += right; right = -num; num = 0; break;
                case '*': right *= num; num = 0; break;
                case '/': right /= num; num = 0; break;
            } 
            if (i >= s.length()) {break;}
            preOp = s[i++];
        }
        return left + right;
    }
};

【Java】

class Solution {
    public int calculate(String s) {
        int left = 0, right = 0, num = 0;
        char preOp = '+';
        for (int i = 0; i < s.length();) {
            while (i < s.length() && s.charAt(i) == ' ') {i++;}
            while (i < s.length() && Character.isDigit(s.charAt(i))) {
                num = num * 10 + (s.charAt(i++) - '0');
            }
            switch(preOp) {
                case '+': left += right; right = num; num = 0;break;
                case '-': left += right; right = -num; num = 0; break;
                case '*': right *= num; num = 0; break;
                case '/': right /= num; num = 0; break;
            }
            if (i >= s.length()) {break;}
            preOp = s.charAt(i++);
        }
        return left + right;
    }
}

参考文献

【1】Java中long（Long）与int（Integer）之间的转换