forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
0020-valid-parentheses.cpp
41 lines (36 loc) · 1016 Bytes
/
0020-valid-parentheses.cpp
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
38
39
40
41
/*
Given s w/ '(, ), {, }, [, ]', determine if valid
Ex. s = "()[]{}" -> true, s = "(]" -> false
Stack of opens, check for matching closes & validity
Time: O(n)
Space: O(n)
*/
class Solution {
public:
bool isValid(string s) {
stack<char> open;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ')' || s[i] == '}' || s[i] == ']') {
if (open.empty()) {
return false;
}
if (s[i] == ')' && open.top() != '(') {
return false;
}
if (s[i] == '}' && open.top() != '{') {
return false;
}
if (s[i] == ']' && open.top() != '[') {
return false;
}
open.pop();
} else {
open.push(s[i]);
}
}
if (!open.empty()) {
return false;
}
return true;
}
};