mirror of
https://github.com/arkorty/LeetCode.git
synced 2026-03-17 16:51:46 +00:00
Initial commit
This commit is contained in:
26
Hard/longest-valid-parentheses/solution.cpp
Normal file
26
Hard/longest-valid-parentheses/solution.cpp
Normal file
@@ -0,0 +1,26 @@
|
||||
#include <stack>
|
||||
#include <string>
|
||||
|
||||
class Solution {
|
||||
public:
|
||||
int longestValidParentheses(std::string line) {
|
||||
std::stack<int> shelf;
|
||||
shelf.push(-1);
|
||||
|
||||
int max = 0;
|
||||
for (int i = 0; i < line.length(); ++i) {
|
||||
if (line[i] == '(') {
|
||||
shelf.push(i);
|
||||
} else {
|
||||
shelf.pop();
|
||||
if (shelf.empty()) {
|
||||
shelf.push(i);
|
||||
} else if (max < i - shelf.top()) {
|
||||
max = i - shelf.top();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return max;
|
||||
}
|
||||
};
|
||||
Reference in New Issue
Block a user