1190. Reverse Substrings Between Each Pair of Parentheses
约 1 分钟
LeetCode 每日一题：Reverse Substrings Between Each Pair of Parentheses
You are given a string 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.
Constraints:
1 <= s.length <= 2000sonly contains lower case English characters and parentheses.- It is guaranteed that all parentheses are balanced.
思路
笔者今天疯狂走了一天 太累了 原谅我暂时先贴出代码
纯粹按照直觉写的，事实上本题有优化空间……而我不太想动脑子了
python
class Solution:
def reverseParentheses(self, s: str) -> str:
temp = []
for c in s:
if c == '(':
temp.append('(')
elif c == ')':
if temp and temp[-1] != '(':
cur = temp.pop()
temp.pop()
if temp and temp[-1] != '(':
temp[-1] += cur[::-1]
else:
temp.append(cur[::-1])
else:
temp.pop()
else:
if temp and temp[-1] != '(':
temp[-1] += c
else:
temp.append(c)
return ''.join(temp)系列每日一题 →
标签栈