Leetcode 1190. Reverse Substrings Between Each Pair of Parentheses解题报告(python)

最新推荐文章于 2025-02-03 15:37:10 发布

原创最新推荐文章于 2025-02-03 15:37:10 发布 · 463 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python

LeetCode 专栏收录该内容

98 篇文章

订阅专栏

探讨了一种解决LeetCode题目的方法：逆置每对匹配括号内的字符串，从最内层开始，最终结果不含括号。通过Python实现，使用栈结构存储字符串片段，遇到左括号入栈，右括号则取出并逆置栈顶元素。

1190. Reverse Substrings Between Each Pair of Parentheses

Reverse Substrings Between Each Pair of Parentheses python solution

题目描述

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.

在这里插入图片描述

解析

直接法求解，出现几次（）就翻转几次

// An highlighted block
class Solution:
    def reverseParentheses(self, s: str) -> str:
        stack = ['']
        for c in s:
            if c == '(':
                stack.append('')
            elif c == ')':
                add = stack.pop()[::-1]
                stack[-1] += add
            else:
                stack[-1] += c
        return stack.pop()