package stack;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Stack;
class Solution {
public int scoreOfParentheses(String s) {
if(null == s || s.length() < 1 || s.length() % 2 != 0){
return 0;
}
Stack stack = new Stack();
char[] charArray = s.toCharArray();
for (Character k : charArray){
if('(' == k){
stack.push(k);
}else{
int score;
//å¼å§è®¡ç®åæ°
char c = stack.pop();
if(c == '('){
score = 1;
}else{
score = (c - '0')*2;
if(!stack.isEmpty()){
stack.pop();//æ'('ä¹å¼¹åºå»
}
}
if(!stack.isEmpty() && stack.peek() != '('){
score += (stack.pop()-'0');
}
stack.push((char)(score+'0'));
}
}
return stack.pop() - '0';
}
public static void main(String[] args) {
int i = new Solution().scoreOfParentheses("(()(()))");
System.out.println(i);
}
List symbel = new ArrayList() { {
}};
}