leetcode:Longest Valid Parentheses

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

yxsh01

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

阅读量384

点赞数

分类专栏：算法题文章标签： leetcode

本文链接：https://blog.csdn.net/yxsh01/article/details/41524789

版权

算法题专栏收录该内容

22 篇文章 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 result=  0;
        int n= s.length();
        if(n == 0)
            return result;
        int begin = 0;
        int belance = 0;
        for(int i = 0; i < n;i++)
        {
            if(s[i] == '(')
                belance++;
            else if(s[i] == ')')
                belance--;
            if(belance < 0)
            {
                begin = i+1;  
                belance = 0;
            }
            else if(belance == 0)
            {
                result = max(i-begin+1,result);
            }
                
        }
        belance = 0;
        begin = n-1;
        for(int i = n-1; i>=0; i--)
        {
            if(s[i] == '(')
                belance--;
            else if(s[i] == ')')
                belance++;
            if(belance < 0)
            {
                begin = i-1;  
                belance = 0;
            }
            else if(belance == 0)
            {
                result = max(begin-i+1,result);
            }
        }
       
        return result;
    }
};