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 1190 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1190 # by problem number
lcpy gen -s reverse_substrings_between_each_pair_of_parentheses # by problem name
s that consists of lower case English letters and brackets.
Reverse the strings in each pair of matching parentheses, starting from the innermost one.
Your result should not contain any brackets.
Input: s = "(abcd)"
Output: "dcba"
Input: s = "(u(love)i)"
Output: "iloveu"
Explanation: The substring "love" is reversed first, then the whole string is reversed.
Input: s = "(ed(et(oc))el)"
Output: "leetcode"
Explanation: First, we reverse the substring "oc", then "etco", and finally, the whole string.
1 <= s.length <= 2000s only contains lower case English characters and parentheses.class Solution:
# Time: O(n^2) worst case, O(n) average
# Space: O(n)
def reverse_parentheses(self, s: str) -> str:
stack: list[str] = []
for char in s:
if char == ")":
segment: list[str] = []
while stack and stack[-1] != "(":
segment.append(stack.pop())
stack.pop()
stack.extend(segment)
else:
stack.append(char)
return "".join(stack)
| Time | Space |
|---|---|
| O(n^2) worst case, O(n) average | O(n) |