MediumNo. 0856
Score of Parentheses — LeetCode 856 Python Solution
- Pattern
- Stack
- Topics
- Stack, String
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given a balanced parentheses string s, return the score of the string. The score of a balanced parentheses string is based on the following rule: "()" has score 1.
Example
- Input
- s = "()"
- Output
- 1
Python solution
class Solution:
def scoreOfParentheses(self, s: str) -> int:
ans = d = 0
for i, c in enumerate(s):
if c == '(':
d += 1
else:
d -= 1
if s[i - 1] == '(':
ans += 1 << d
return ansComplexity
- Time
- O(n)
- Space · auxiliary
- O(1)
Pattern: Stack
When the most recent unresolved thing is the one that matters, use a stack. LeetCode 856. Score of Parentheses is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Stack.
The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0020 | Valid Parentheses | Easy |
| 0071 | Simplify Path | Medium |
| 0224 | Basic Calculator | Hard |
| 0227 | Basic Calculator II | Medium |
| 0331 | Verify Preorder Serialization of a Binary Tree | Medium |
| 0385 | Mini Parser | Medium |
Frequently asked questions
- How hard is LeetCode 856. Score of Parentheses?
LeetCode 856. Score of Parentheses is rated Medium on LeetCode.
- What is the time complexity of LeetCode 856. Score of Parentheses?
The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 856. Score of Parentheses?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 856. Score of Parentheses cover?
LeetCode 856. Score of Parentheses is tagged Stack and String on LeetCode.