Leetcode 224: Basic Calculator

最新推荐文章于 2024-09-04 21:24:34 发布

xudli

最新推荐文章于 2024-09-04 21:24:34 发布

阅读量9.4k

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/46554835

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Basic Calculator

Total Accepted: 2801 Total Submissions: 18103

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.

You may assume that the given expression is always valid.

Some examples:

"1 + 1" = 2
" 2-1 + 2 " = 3
"(1+(4+5+2)-3)+(6+8)" = 23

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

[思路]

遇到 '(' 就把之前的结果和符号push进stack. 遇到')'就把当前结果*stack中的符号再加上stack中之前的结果.

[CODE]

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