-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathValid Parentheses.cpp
44 lines (30 loc) · 1.08 KB
/
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
42
43
44
/*
Solution by Rahul Surana
***********************************************************
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.
***********************************************************
*/
#include <bits/stdc++.h>
class Solution {
public:
bool isValid(string &s) {
stack<char> st;
for(int i = 0; i < s.length(); i++){
if(s[i]=='(' || s[i]=='{' || s[i] == '['){
st.push(s[i]);
}
else{
if(st.empty())return false;
char x = st.top();
st.pop();
if(x == '(' && s[i] != ')') return false;
if(x == '{' && s[i] != '}') return false;
if(x == '[' && s[i] != ']') return false;
}
}
return st.size() == 0? true:false;
}
};