longest_valid_parentheses

README

< Previous 　　　　　　　　　　　　　　　　 Next >

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: "(()"
Output: 2
Explanation: The longest valid parentheses substring is "()"

Example 2:

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

Related Topics

[String] [Dynamic Programming]

Similar Questions

1. Valid Parentheses (Easy)