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

最新推荐文章于 2022-02-07 08:22:57 发布

orientliu96

最新推荐文章于 2022-02-07 08:22:57 发布

阅读量382

点赞数

分类专栏： LeetCode 文章标签： leetcode python

本文链接：https://blog.csdn.net/Orientliu96/article/details/103745351

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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()