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 1614 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1614 # by problem number
lcpy gen -s maximum_nesting_depth_of_the_parentheses # by problem name
s, return the nesting depth of s. The nesting depth is the maximum number of nested parentheses.
Input: s = "(1+(2*3)+((8)/4))+1"
Output: 3
Explanation: Digit 8 is inside of 3 nested parentheses in the string.
Input: s = "(1)+((2))+(((3)))"
Output: 3
Explanation: Digit 3 is inside of 3 nested parentheses in the string.
Input: s = "()(())((()()))"
Output: 3
1 <= s.length <= 100s consists of digits 0-9 and characters '+', '-', '*', '/', '(', and ')'.s is a VPS.class Solution:
# Time: O(n)
# Space: O(1)
def max_depth(self, s: str) -> int:
depth = 0
best = 0
for char in s:
if char == "(":
depth += 1
if depth > best:
best = depth
elif char == ")":
depth -= 1
return best
| Time | Space |
|---|---|
| O(n) | O(1) |