LeetCode.4.longest-valid-parentheses

题目描述

给出一个仅包含字符’(‘和’)'的字符串，计算最长的格式正确的括号子串的长度。
对于字符串"(()“来说，最长的格式正确的子串是”()"，长度为2.
再举一个例子：对于字符串")()())",来说，最长的格式正确的子串是"()()"，长度为4.

Given a string containing just the characters’(‘and’)’, find the length of the longest valid (well-formed) parentheses substring.
For"(()", the longest valid parentheses substring is"()", which has length = 2.

Another example is")()())", where the longest valid parentheses substring is"()()", which has length = 4.
上代码：
第一种：

public class Solution {
    public int longestValidParentheses(String s) {
        if(s.length()==0 || s.equals("")) {
            return 0;
        }
        char[] st = s.toCharArray();
        int[] dp = new int[st.length];
        int pre = 0;
        int res = 0;
        for(int  i=1;i<st.length;i++) {
            if(st[i]==')') {
                pre = i-dp[i-1]-1;
                if(pre>=0 && st[pre]=='(') {
                    dp[i] = dp[i-1]+2+(pre>0?dp[pre-1]:0);
                }
            }
            res = Math.max(res,dp[i]);
        }
        return res;
    }
}

第二种：

/*
 * 非动态规划，有时候会超时
 */
public int longestValidParentheses(String s) {
    if (s == null || s.length() < 1)
        return 0;
    Stack<Integer> stack = new Stack<Integer>();
    int max = 0, left = -1;
    for (int i = 0; i < s.length(); i++) {
        if (s.charAt(i) == '(')
            stack.push(i);
        else {
            if (!stack.isEmpty()) {
                stack.pop();
                if (!stack.isEmpty())
                    max = Math.max(max, i - stack.peek());
                else
                    max = Math.max(max, i - left);
            } else
                left = i;
        }
    }
    return max;
}
// Your runtime beats 92.48 % of java submissions.
public int longestValidParentheses2(String s) {
    if (s == null || s.length() == 0)
        return 0;
    int[] dp = new int[s.length()];
    int ans = 0;
    for (int i = 1; i < s.length(); i++) {
        // 如果是'('直接跳过，默认为0
        if (s.charAt(i) == ')') {
            if (s.charAt(i - 1) == '(')
                dp[i] = (i >= 2 ? dp[i - 2] : 0) + 2;
            // 说明s.charAt(i - 1)==')'
            else if (i - dp[i - 1] > 0 && s.charAt(i - dp[i - 1] - 1) == '(') {
                dp[i] = (i - dp[i - 1] > 1 ? dp[i - dp[i - 1] - 2] : 0) + dp[i - 1] + 2;
                // 因为加了一个左括号和一个右括号，所以是加2
            }
        }
        ans = Math.max(ans, dp[i]);
    }
    return ans;
}