【LeetCode】32. Longest Valid Parentheses

最新推荐文章于 2024-02-09 15:39:44 发布

YolandaJia

最新推荐文章于 2024-02-09 15:39:44 发布

阅读量209

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/YolandaJia/article/details/81905145

版权

LeetCode 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

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 "()()"

Solution 1: O(n) with using stack, 29.54%

public int longestValidParentheses(String s) {
        if (s == null || s.length() == 0) {
            return 0;
        }
        Stack<Integer> stack = new Stack<>();
        int start = -1;
        int maxLen = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '(') {
                stack.push(i);
            } else {
                if (stack.isEmpty()) {
                    start = i;
                } else {
                    stack.pop();
                    if (stack.isEmpty()) { //need to check if stack is empty : ((), (())
                        maxLen = Math.max(maxLen, i - start);
                    } else {
                        maxLen = Math.max(maxLen, i - stack.peek());
                    }
                    
                }
            }
        }
        return maxLen;
    }

Solution 2: O(n) with using DP, 15.46%

public int longestValidParentheses(String s) {
        if (s == null || s.length() == 0) {
            return 0;
        }
        int maxLen = 0;
        int dp[] = new int[s.length()];
        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i) == ')') {
                if (s.charAt(i - 1) == '(') {
                    dp[i] = ((i >= 2) ? dp[i - 2] : 0) + 2;
                } else {
                    if ((i - dp[i - 1] - 1) >= 0 && s.charAt(i - dp[i - 1] - 1) == '(') {
                        dp[i] = dp[i - 1] + 2 + ((i - dp[i - 1] - 2) >= 0 ? dp[i - dp[i - 1] - 2] : 0);
                    }
                }
            }
            if (maxLen < dp[i]) {
                maxLen = dp[i];
            }
        }
        return maxLen;   
    }