#栈#leetcode856.括号的分数

class Solution {
    public int scoreOfParentheses(String S) {
        //定义 (  为 0
        Deque<Integer> s  = new LinkedList<>();
        s.push(0);
        for(char c : S.toCharArray()) {
            if(c== ‘(‘) {
                s.push(0);
            }else{
                int top = s.pop();
                int pre = s.pop();
                s.push(Math.max(2*top,1)+pre);
            }
        }
        return s.pop();
    }
}