LeetCode 32. Longest Valid Parentheses

最新推荐文章于 2024-10-01 05:04:32 发布

青帆1998

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量55

点赞数

文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/weixin_43762534/article/details/122059682

版权

题目描述

Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.

解题思路

解题方法参考了该链接 https://blog.csdn.net/accepthjp/article/details/52439449
总结一下，DP思想。

代码 (Python3)

class Solution:
    def longestValidParentheses(self, s: str) -> int:
        s = ')' + s
        dp = [0 for _ in range(len(s))]
        ans = 0
        for i in range(1, len(s)):
            if s[i] == ')':
                if s[i - 1 - dp[i - 1]] == '(':
                    dp[i] = dp[i - 1] + 2
                    dp[i] += dp[i - dp[i]]

            ans = max(ans, dp[i])
        return ans