题目:
一个只包含 '(' 和 ')' 的字符串,找出最长连续且有效括号子串的长度(如:()或(()))。
示例 1:
输入:s = "(()"
输出:2
解释:最长有效括号子串是 "()"
示例 2:
输入:s = ")()())"
输出:4
解释:最长有效括号子串是 "()()"
示例 3:
输入:s = ""
输出:0
提示:
0 <= s.length <= 3 * 104
s[i] 为 '(' 或 ')'
分析:
方法一. 区间动态(耗时) f(x, y) = max{f(x, k) + f(k+1, y)}
方法二. 线性动态:以i为结尾最长有效值为dp[i], 有二种有效情况()或....))
代码1:
char[] arr = s.toCharArray();
int max = 0;
int len = s.length();
int[][] dp = new int[len][len];
for (int i = 1; i < len; i++) {
dp[i-1][i] = arr[i-1] == '(' && arr[i] == ')' ? 2 : 0;
max = Math.max(max, dp[i-1][i]);
}
for (int m = 4; m <= len; m+=2) {
for (int n = 0; n <= len - m; n++) {
int end = n + m - 1;
dp[n][end] = Math.max(dp[n][end],
arr[n] == '(' && arr[end] == ')' && dp[n+1][end-1] > 0
? dp[n+1][end-1] + 2: 0);
for (int k = 2; k < m; k+=2) {
dp[n][end] = Math.max(dp[n][end],
dp[n][n+k-1]*dp[n+k][end] == 0
? 0 : dp[n][n+k-1]+dp[n+k][end]);
}
max = Math.max(max, dp[n][end]);
}
}
return max;
}
代码2:
class Solution {
public int longestValidParentheses(String s) {
char[] arr = s.toCharArray();
int max = 0;
int len = s.length();
int[] dp = new int[len];
for (int i = 1; i < len; i++) {
if(arr[i] == ')') {
if (arr[i-1] == '(') {
dp[i] = (i >= 2 ? dp[i-2] : 0) + 2;
} else if (i > dp[i-1] && arr[i - dp[i-1] - 1] == '(') {
dp[i] = dp[i-1] + 2 +
(i - dp[i-1] - 2 >= 0 ? dp[i - dp[i-1] - 2] : 0);
}
max = Math.max(max, dp[i]);
}
}
return max;
}
}