g0001_0100.s0032_longest_valid_parentheses.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
32\. Longest Valid Parentheses
Hard
Given a string containing just the characters `'('` and `')'`, find the length of the longest valid (well-formed) parentheses substring.
**Example 1:**
**Input:** s = "(()"
**Output:** 2
**Explanation:** The longest valid parentheses substring is "()".
**Example 2:**
**Input:** s = ")()())"
**Output:** 4
**Explanation:** The longest valid parentheses substring is "()()".
**Example 3:**
**Input:** s = ""
**Output:** 0
**Constraints:**
* 0 <= s.length <= 3 * 104
* `s[i]` is `'('`, or `')'`.