Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 856 with 23 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 856 # by problem number
lcpy gen -s score_of_parentheses # by problem name
s, return the score of the string.
The score of a balanced parentheses string is 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: s = "()"
Output: 1
Input: s = "(())"
Output: 2
Input: s = "()()"
Output: 2
'(' and ')'.class Solution:
# Time: O(n)
# Space: O(n)
def score_of_parentheses(self, s: str) -> int:
stack = [0]
for char in s:
if char == "(":
stack.append(0)
else:
inner = stack.pop()
stack[-1] += max(2 * inner, 1)
return stack[0]
| Time | Space |
|---|---|
| O(n) | O(n) |