-
Notifications
You must be signed in to change notification settings - Fork 3
/
validParantheseis.cpp
49 lines (44 loc) · 1.36 KB
/
validParantheseis.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
42
43
44
45
46
47
48
49
/*
Given a string s 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.
Every close bracket has a corresponding open bracket of the same type.
*/
class Solution {
public:
bool isValid(string s) {
stack<char> st;
//Whenever you encounter an opening bracket immediately check for its closing
//bracket
for(auto bracket: s)
{
if(bracket == '(' || bracket == '{' || bracket == '[')
{
st.push(bracket);
}
else
{
if(st.empty()) return false;
else
{
char top = st.top();
if(bracket == ')' && top == '(')
{
st.pop();
}
else if(bracket == '}' && top == '{')
{
st.pop();
}
else if(bracket == ']' && top == '[')
{
st.pop();
}
else return false;
}
}
}
return st.empty();
}
};