LeetCode 0032 - Longest Valid Parentheses

Reck Zhang

发布于 2021-08-11 10:33:04

1640

发布于 2021-08-11 10:33:04

文章被收录于专栏：Reck Zhang

Longest Valid Parentheses

Desicription

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.

Solution

class Solution {
public:
    int longestValidParentheses(string s) {
        stack<int>Q;
        for(int i = 0; s[i]; i++){
            if(Q.empty())
                Q.push(i);
            else{
                if(s[Q.top()] == '(' && s[i] == ')')
                    Q.pop();
                else
                    Q.push(i);
            }
        }
        if(Q.empty())
            return s.length();
        int res = 0;
        int right = s.length();
        int left = 0;
        while(!Q.empty()){
            left = Q.top();
            Q.pop();
            res = max(res, right - left - 1);
            right = left;
        }
        res = max(res, right);
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-11，如有侵权请联系 cloudcommunity@tencent.com 删除

javascript