-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathValid Parentheses.cpp
18 lines (17 loc) · 1.07 KB
/
Valid Parentheses.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
// Runtime: 0 ms (Top 100.0%) | Memory: 6.70 MB (Top 37.86%)
class Solution {
public:
bool isValid(string s) {
stack<char> st; //taking stack for keep tracking the order of the brackets..
for(auto i:s) //iterate over each and every elements
{
if(i=='(' or i=='{' or i=='[') st.push(i); //if current element of the string will be opening bracket then we will just simply push it into the stack
else //if control comes to else part, it means that current element is a closing bracket, so check two conditions current element matches with top of the stack and the stack must not be empty...
{
if(st.empty() or (st.top()=='(' and i!=')') or (st.top()=='{' and i!='}') or (st.top()=='[' and i!=']')) return false;
st.pop(); //if control reaches to that line, it means we have got the right pair of brackets, so just pop it.
}
}
return st.empty(); //at last, it may possible that we left something into the stack unpair so return checking stack is empty or not..
}
};