- 最长有效括号
给你一个只包含 ‘(’ 和 ‘)’ 的字符串,找出最长有效(格式正确且连续)括号子串的长度。
动态规划
class Solution {
public:
int longestValidParentheses(string s) {
vector<int> dp(s.size());
int maxAns = 0;
for (int i = 1; i < s.size(); ++i) {
if (s[i] == ')') {
if (s[i - 1] == '(') {
dp[i] = (i - 2 >= 0 ? dp[i - 2] : 0) + 2;
} else if (i - dp[i - 1] - 1 >= 0 && s[i - dp[i - 1] -1] == '(') {
dp[i] = dp[i - 1] + (i - dp[i - 1] - 2 >= 0 ? dp[i - dp[i - 1] - 2] : 0) + 2;
}
maxAns = max(maxAns, dp[i]);
}
}
return maxAns;
}
};
栈
class Solution {
public:
int longestValidParentheses(string s) {
int maxAns = 0;
stack<int> stk;
stk.push(-1);
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
stk.push(i);
} else {
stk.pop();
if (stk.empty()) {
stk.push(i);
} else {
maxAns = max(maxAns, i - stk.top());
}
}
}
return maxAns;
}
};
左右两次遍历
class Solution {
public:
int longestValidParentheses(string s) {
int left = 0;
int right = 0;
int maxAns = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
++left;
} else {
++right;
}
if (left == right) {
maxAns = max(maxAns, left * 2);
} else if (right > left) {
left = 0;
right = 0;
}
}
left = 0;
right = 0;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == '(') {
++left;
} else {
++right;
}
if (left == right) {
maxAns = max(maxAns, left * 2);
} else if (left > right) {
left = 0;
right = 0;
}
}
return maxAns;
}
};