This approach uses a stack to efficiently match opening and closing brackets. The stack stores opening brackets, and for each closing bracket encountered, it checks if it closes the last opened bracket (top of the stack).
Time Complexity: O(n), where n is the length of the string, since we process each character once.
Space Complexity: O(n) in the worst case if the string consists only of opening brackets.
1function isValid(s) {
2 const stack = [];
3 const map = {
4 ')': '(',
5 '}': '{',
6 ']': '['
7 };
8 for (const char of s) {
9 if (map[char]) {
10 if (stack.pop() !== map[char]) {
11 return false;
12 }
13 } else {
14 stack.push(char);
15 }
16 }
17 return stack.length === 0;
18}
19
20console.log(isValid("()[]{}")); // Output: true
21console.log(isValid("(]")); // Output: falseThe JavaScript solution uses an array as a stack for keeping track of open brackets and a map to match them with closing brackets, ensuring a valid structure of the input string.
This approach uses two pointers with stack-like behavior internally, taking advantage of simple list operations for push and pop.
Time Complexity: O(n)
Space Complexity: O(n/2) = O(n)
1#include <string>
2bool isValid(std::string s) {
3 if (s.size() % 2 != 0) return false;
4
5 std::string stack;
6 for (char& c : s) {
7 if (c == '(' || c == '{' || c == '[') {
8 stack.push_back(c);
9 } else {
10 if (stack.empty()) return false;
11 char top = stack.back();
12 stack.pop_back();
13 if ((c == ')' && top != '(') ||
14 (c == '}' && top != '{') ||
15 (c == ']' && top != '['))
16 return false;
17 }
18 }
19 return stack.empty();
20}The C++ solution here enhances string utilization with back() and pop_back() methods, forming a stack, but seeks to access in a controlled way without appending complex data structures.