[LeetCode] Basic Calculator

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.

自己写不好，参照了https://leetcode.com/discuss/39553/iterative-java-solution-with-stack

基本思路：把input分割成了 （sign number）这样的组合。储存最邻近的sign和number

每次看到新的符号，就知道要把之前存储的number*sign加到result上去

遇到（， 则把之前的sign和number存到stack中，然后把各变量调到初始状态（即看到“（”就等于开始了新的cycle）

遇到 ）。就把之前存储的sign和result取出

public class Solution {
    public int calculate(String s) {
        int number = 0;
        int result = 0;
        int sign = 1;
        Stack<Integer> stack = new Stack<>();
        for(int i = 0; i < s.length(); i++){
            char currentChar = s.charAt(i);
            if(currentChar >= '0' && currentChar <= '9'){
                number *= 10;
                number += currentChar - '0';
            }
            else if(currentChar == '+'){
                result += sign * number;
                sign = 1;
                number = 0;
            }
            else if(currentChar == '-'){
                result += sign*number;
                sign = -1;
                number = 0;
            }
            else if(currentChar == '('){
                stack.push(sign);
                stack.push(result);
                number = 0;
                sign = 1;
                result = 0;
            }
            else if(currentChar == ')'){
                result += sign*number;
                int pre_result = stack.pop();
                int pre_sign = stack.pop();
                result = pre_sign*result + pre_result;
                number = 0;
                sign = 1;
            }
        }
        return result + sign*number;
    }
}