Package g0001_0100.s0032_longest_valid_parentheses

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>0 <= s.length <= 3 * 10<sup>4</sup></code>

    • s[i] is '(', or ')'.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer longestValidParentheses(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait