Given a string containing just the characters '('
and ')'
, find the length of the longest valid (well-formed) parentheses substring.
Example 1:
Input: "(()"
Output: 2
Explanation: The longest valid parentheses substring is "()"
Example 2:
Input: ")()())
" Output: 4 Explanation: The longest valid parentheses substring is"()()"
代码分析:
维护一个栈,里面保存'('的下标,每次进入一个')'时,栈弹出,maxLen更新为当前扫描的下标与栈顶元素之间的距离(因为中间可能有些括号已经被消掉了),因为栈可能为空,所以需要记录下起始记录点start。
代码如下:
class Solution {
public:
int longestValidParentheses(string s) {
int n = s.size();
int maxLen = 0; // 记录有效括号的最大长度;
int start = 0; // 记录有效括号的起始位置
stack<int> st;
for(int i = 0; i < n; i++) {
if(s[i] == '(') {
st.push(i);
} else {
if(st.empty()) start = i + 1;
else {
st.pop();
if(st.empty()) {
maxLen = max(maxLen, i - start + 1);
} else {
maxLen = max(maxLen, i - st.top());
}
}
}
}
return maxLen;
}
};