【力扣 困难 C】32. 最长有效括号

目录

题目

解法一：动态规划

题目

解法一：动态规划

int max(int a, int b) {return a > b ? a : b;
}int longestValidParentheses(char* s) {int len = strlen(s);int* dp = calloc(len, sizeof(*dp));int maxLen = 0;for (int i = 1; i < len; i++) {if (s[i] == ')') {int preIndex = i - dp[i - 1] - 1;if (preIndex >= 0 && s[preIndex] == '(') {dp[i] = dp[i - 1] + 2 + (preIndex - 1 >= 0 ? dp[preIndex - 1] : 0);}}maxLen = max(maxLen, dp[i]);}free(dp);return maxLen;
}