0856. Score of Parentheses

# 856. Score of Parentheses#

## 题目 #

Given a balanced parentheses string S, compute the score of the string based on the following rule:

() has score 1 AB has score A + B, where A and B are balanced parentheses strings. (A) has score 2 * A, where A is a balanced parentheses string.

Example 1:

``````
Input: "()"
Output: 1

``````

Example 2:

``````
Input: "(())"
Output: 2

``````

Example 3:

``````
Input: "()()"
Output: 2

``````

Example 4:

``````
Input: "(()(()))"
Output: 6

``````

Note:

1. S is a balanced parentheses string, containing only ( and ).
2. 2 <= S.length <= 50

## 代码 #

``````
package leetcode

func scoreOfParentheses(S string) int {
res, stack, top, temp := 0, []int{}, -1, 0
for _, s := range S {
if s == '(' {
stack = append(stack, -1)
top++
} else {
temp = 0
for stack[top] != -1 {
temp += stack[top]
stack = stack[:len(stack)-1]
top--
}
stack = stack[:len(stack)-1]
top--
if temp == 0 {
stack = append(stack, 1)
top++
} else {
stack = append(stack, temp*2)
top++
}
}
}
for len(stack) != 0 {
res += stack[top]
stack = stack[:len(stack)-1]
top--
}
return res
}

``````

Apr 8, 2023