-
Notifications
You must be signed in to change notification settings - Fork 0
/
Valid Parentheses.txt
175 lines (121 loc) · 2.37 KB
/
Valid Parentheses.txt
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
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.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Example 4:
Input: s = "([)]"
Output: false
Example 5:
Input: s = "{[]}"
Output: true
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.
#include <bits/stdc++.h>
using namespace std;
unordered_map<char,int> symbols = {{'[',-1},{'(',-2},{'{',-3},{']',1},{')',2},{'}',3}};
string isBalanced(string s)
{
stack <char> st;
for(char bracket : s)
{
if(symbols[bracket] < 0)
{
st.push(bracket);
}
else
{
if(st.empty())
return "NO";
char top = st.top();
st.pop();
if(symbols[top] + symbols[bracket] != 0 )
return "NO";
}
}
if(st.empty())
{
return "YES";
}
else
{
return "NO";
}
}
int main()
{
int t;
cin >> t;
while(t--)
{
string s;
cin >> s;
cout << isBalanced(s) << endl;
}
}
/*
#include <bits/stdc++.h>
using namespace std;
bool isBalanced(string s)
{
stack<char> st;
char x;
for (int i = 0; i < s.size(); i++)
{
if(s.empty())
{
return false;
}
if (s[i] == '(' || s[i] == '[' || s[i] == '{')
{
st.push(s[i]);
continue;
}
switch (s[i])
{
case ')':
x = st.top();
st.pop();
if (x == ']' || x == '}')
return false;
break;
case ']':
x = st.top();
st.pop();
if (x == ')' || x == '}')
return false;
break;
case '}':
x = st.top();
st.pop();
if (x == ')' || x == ']')
return false;
break;
}
}
if (st.empty())
{
return true;
}
else
{
return false;
}
}
int main()
{
string s;
cout << "Enter a string : ";
cin >> s;
cout << isBalanced(s);
}
*/