Leetcode 32 最长有效括号

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;

int dp[100010];
int longestValidParentheses(string s)
{
    int Len = s.length();
    memset(dp,0,sizeof(dp));
    int mx = -1;
    for(int i=1; i<Len; i++)
    {
        if(s[i] == ‘)‘)
        {
            if(s[i-1] == ‘(‘)
            {
                dp[i] = 2;
                if(i-2>=0)
                    dp[i] += dp[i-2];
            }
            else
            {
                if(s[i-dp[i-1]-1] == ‘(‘)
                {
                    dp[i] = 2+dp[i-1];
                    if(i-dp[i-1]-2 >=0)
                        dp[i] += dp[i-dp[i-1]-2];
                }
            }
        }
        mx = max(dp[i],mx);
    }

    for(int i=0;i<Len;i++) cout << dp[i] <<" ";
    cout <<endl;
    return mx;
}
int main()
{

    string s= "()(())";
    cout << longestValidParentheses(s) <<endl;
    return 0;
}