leetcode-Longest Valid Parentheses

最新推荐文章于 2022-09-01 00:56:47 发布

miao65272156

最新推荐文章于 2022-09-01 00:56:47 发布

阅读量277

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/miao65272156/article/details/39554059

版权

leetcode 专栏收录该内容

109 篇文章 0 订阅

订阅专栏

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.

class Solution {
public:
    int longestValidParentheses(string s) {
        int n = 0;
        int ret = 0;
        int i = 0;
        vector<int> a;
        vector<int> b;
        while(s[i])
        {
            int m = a.size();
            if(n == 0)
            {
                if(s[i] =='(')
                {
                    a.push_back(1);
                    b.push_back(0);
                    n++;
                }
                else if(s[i] == ')')
                {
                    a.push_back(-1);
                    b.push_back(0);
                }
            }
            else if(n > 0)
            {
                if(s[i] == '(')
                {
                    if(s[i-1] == ')')
                    {
                        a.push_back(1);
                        b.push_back(0);
                        n++;
                    }
                    else if(s[i-1] == '(')
                    {
                        n++;
                        a[m-1]++;
                    }
                }
                else if(s[i] == ')')
                {
                    while(a[m-1] == 0)m--;
                    a[m-1]--;
                    b[m-1]++;
                    n--;
                }
            }
            i++;
        }
        i = 0;
        int m = a.size();
        while(i < m-1)
        {
            int count = b[i];
            while ((i < m-1)&&(a[i+1] == 0))
            {
                count += b[++i];
            }
            if(count > ret)ret = count;
            i++;
        }
        if((m > 0)&&(b[m-1] > ret))ret = b[m-1];
        return ret*2;
    }
};