首页 > 代码库 > Longest Valid Parentheses
Longest Valid Parentheses
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> lefts; // index of left parentheses. int len = s.length(); if(len < 2) return 0; int start = -1; int res = 0; for (int i=0;i<len;i++){ if(s[i] == ‘(‘){ lefts.push(i); }else{ if(lefts.empty()){ start = i; }else{ lefts.pop(); if(lefts.empty()){ res = max(res,i - start); }else{ res = max(res,i- lefts.top()); } } } } return res; }};
Longest Valid Parentheses
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。