-
Notifications
You must be signed in to change notification settings - Fork 0
/
validParentheses.js
37 lines (29 loc) · 1007 Bytes
/
validParentheses.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/* https://leetcode.com/problems/valid-parentheses/ */
function validParentheses(str) {
let regex = /\((?:[^)(]+|\((?:[^)(]+|\([^)(]*\))*\))*\)/g;
return regex.test(str);
}
console.log(
validParentheses("(])[]{}")
);
// Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
/*
Runtime: 1 ms, faster than 99.17%
Memory Usage: 37.3 MB, less than 58.94%
public boolean isValid(String s) {
Stack<Character> st = new Stack<>();
for(int i = 0; i < s.length(); i++){
char top = st.empty() ? '#' : st.peek();
if(top == '(' && s.charAt(i) == ')') {
st.pop();
}else if(top == '{' && s.charAt(i) == '}') {
st.pop();
}else if(top == '[' && s.charAt(i) == ']') {
st.pop();
}else{
st.push(s.charAt(i));
}
}
return st.empty();
}
*/