diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/longest_valid_parentheses.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/longest_valid_parentheses.cpp')
-rw-r--r-- | other/longest_valid_parentheses.cpp | 41 |
1 files changed, 0 insertions, 41 deletions
diff --git a/other/longest_valid_parentheses.cpp b/other/longest_valid_parentheses.cpp deleted file mode 100644 index 953e8be..0000000 --- a/other/longest_valid_parentheses.cpp +++ /dev/null @@ -1,41 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int longestValidParentheses(string s) { - int n = s.size(), ans = 0; - stack<int> stk; - for (int i = 0; i < n; i++) { - if (s[i] == '(') - stk.push(i); - else { - if (!stk.empty()) { - if (s[stk.top()] == '(') - stk.pop(); - else - stk.push(i); - } else - stk.push(i); - } - } - if (stk.empty()) - ans = n; - else { - int a = n, b = 0; - while (!stk.empty()) { - b = stk.top(); - stk.pop(); - ans = max(ans, a - b - 1); - a = b; - } - ans = max(ans, a); - } - return ans; - } -}; - -int main() { - Solution obj; - string s = ")()())"; - cout << obj.longestValidParentheses(s); -} |