32. Longest Valid Parentheses

题目：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.

思路：本题的目的是要求出最长的连续有效匹配括号子串，利用动态规划去解决，用dp[i]表示以s[i]结尾的最长有效长度，显然，有效的子串一定是以’)’结尾，所以只需考虑以’)’结尾的下标。当s[i]==’)’时有两种情况：
1. 当s[i-1]== ‘(’ 时，dp[i] = 2 + dp[i-2];
2. 当s[i-1]== ‘)’ 时，dp[i] = s[i-dp[i-1]-2]==’(’ ? (dp[i-1] +2+(i-dp[i-1]-2 > 0 ? dp[i-dp[i-1]-2] : 0)) : 0;

算法实现如下：

class Solution {
public:
    int longestValidParentheses(string s) {
       if (s.size() < 2) return 0;
       int n = s.size(), res = 0;
       vector<int> dp(n+1, 0);

       for (int i = 2; i <= n; i++) {
            if (s[i-1] == ')') {
                if (s[i-2] == '(') dp[i] = dp[i-2] + 2;
                else dp[i] = s[i-dp[i-1]-2]=='(' ? (dp[i-1] + 2+(i-dp[i-1]-2 > 0 ? dp[i-dp[i-1]-2] : 0)) : 0;
            }
            res = max(res, dp[i]);
        }
        return res;
    }
};