-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode_20_Valid_Parentheses.cpp
More file actions
54 lines (47 loc) · 1016 Bytes
/
Copy pathLeetCode_20_Valid_Parentheses.cpp
File metadata and controls
54 lines (47 loc) · 1016 Bytes
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
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
- Open brackets must be closed by the same type of brackets.
- Open brackets must be closed in the correct order.
- Note that an empty string is also considered valid.
Example 1:
Input: "()"
Output: true
Example 2:
Input: "()[]{}"
Output: true
Example 3:
Input: "(]"
Output: false
Example 4:
Input: "([)]"
Output: false
Example 5:
Input: "{[]}"
Output: true
*/
class Solution {
public:
bool isValid(string s) {
stack< char > st;
for( int i = 0; i < s.length(); i++ ) {
if( s[i] == '(' ) {
st.push( ')' );
} else if( s[i] == '[' ) {
st.push( ']' );
} else if( s[i] == '{' ) {
st.push( '}' );
} else {
if( st.empty() ) {
return false;
}
if( st.top() != s[i] ) {
return false;
}
st.pop();
}
}
// in end stack should be empty
return st.empty();
}
};