0032-longest-valid-parentheses.adoc

32. Longest Valid Parentheses

{leetcode}/problems/longest-valid-parentheses/[LeetCode - Longest Valid Parentheses^]

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

Example 1:

Input: "(()"
Output: 2
Explanation: The longest valid parentheses substring is "()"

Example 2:

Input: “)()())”
Output: 4
Explanation: The longest valid parentheses substring is "()()"

link:{sourcedir}/_0032_LongestValidParentheses.java[role=include]