-
Notifications
You must be signed in to change notification settings - Fork 0
/
Balanced_Parenthesis.cpp
50 lines (45 loc) · 1.03 KB
/
Balanced_Parenthesis.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
50
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool isBalanced(string exp)
{
stack<char> st;
for (char br : exp)
{
if (br == '(' || br == '{' || br == '[')
{
st.push(br);
}
else if (br == ')' || br == '}' || br == ']')
{
if (st.empty())
{
return false;
}
else if ((br == ')' && st.top() != '(') ||
(br == '}' && st.top() != '{') ||
(br == ']' && st.top() != '['))
{
return false;
}
st.pop();
}
}
return st.empty(); // If stack is empty, all parentheses are balanced
}
int main()
{
string exp;
cout << "Enter an exp with parentheses: ";
cin >> exp;
if (isBalanced(exp))
{
cout << "Parentheses are balanced!\n";
}
else
{
cout << "Parentheses are not balanced!\n";
}
return 0;
}