leetcode---longest-valid-parentheses---栈

最新推荐文章于 2020-07-22 16:13:00 发布

谛听-

最新推荐文章于 2020-07-22 16:13:00 发布

阅读量145

点赞数

分类专栏：题

本文链接：https://blog.csdn.net/u012319493/article/details/79399407

版权

题专栏收录该内容

456 篇文章 1 订阅

订阅专栏

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) 
    {
        stack<int> st;
        int start = -1;
        int maxl = 0;
        for(int i=0; i<s.size(); i++)
        {
            if(s[i] == '(')
            {
                st.push(i);
            }
            else
            {
                if(!st.empty())
                {
                    st.pop();
                    if(!st.empty())
                        maxl = max(maxl, i-st.top());
                    else
                        maxl = max(maxl, i-start);
                }
                else
                {
                    start = i;
                }
            }
        }
        return maxl;
    }
};