GoLang Solution For LeetCode Problem: 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.
Input: "()" Output: 1
Input: "(())" Output: 2
Input: "()()" Output: 2
Input: "(()(()))" Output: 6
- S is a balanced parentheses string, containing only ( and ).
- 2 <= S.length <= 50
See the full details of the problem Score of Parentheses at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go