longest-valid-parentheses

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string containing just the characters <code>&#39;(&#39;</code> and <code>&#39;)&#39;</code>, return the length of the longest valid (well-formed) parentheses substring.

&nbsp;
Example 1:

<pre>
Input: s = &quot;(()&quot;
Output: 2
Explanation: The longest valid parentheses substring is &quot;()&quot;.
</pre>

Example 2:

<pre>
Input: s = &quot;)()())&quot;
Output: 4
Explanation: The longest valid parentheses substring is &quot;()()&quot;.
</pre>

Example 3:

<pre>
Input: s = &quot;&quot;
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= s.length &lt;= 3 * 104</code></li>
	<li><code>s[i]</code> is <code>&#39;(&#39;</code>, or <code>&#39;)&#39;</code>.</li>
</ul>

longestValidParentheses

Longest Valid Parentheses

Valid Parentheses

valid-parentheses

有效的括号

Stack

String

Dynamic Programming

给你一个只包含 <code>'('</code>&nbsp;和 <code>')'</code>&nbsp;的字符串，找出最长有效（格式正确且连续）括号子串的长度。

&nbsp;

<div class="original__bRMd">
<div>
示例 1：

<pre>
输入：s = "(()"
输出：2
解释：最长有效括号子串是 "()"
</pre>

示例 2：

<pre>
输入：s = ")()())"
输出：4
解释：最长有效括号子串是 "()()"
</pre>

示例 3：

<pre>
输入：s = ""
输出：0
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= s.length &lt;= 3 * 104</code></li>
	<li><code>s[i]</code> 为 <code>'('</code> 或 <code>')'</code></li>
</ul>
</div>
</div>