-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathisReductantBracket.c++
58 lines (52 loc) · 1.14 KB
/
isReductantBracket.c++
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
#include <iostream>
#include <stack>
using namespace std;
bool isReductantBracket(string &s)
{
stack<char> st;
for(int i = 0; i < s.length(); i++)
{
char ch = s[i];
if(ch == '(' || ch == '+' || ch == '-' || ch == '*' || ch == '/')
{
st.push(ch);
}
else
{
if(ch == ')')
{
bool isReductant = true;
while(st.top() != '(')
{
char top = st.top();
if(top == '+' || top == '-' || top == '*' || top == '/')
{
isReductant = false;
}
st.pop();
}
if(isReductant == true)
{
return true;
}
st.top();
}
}
}
return false;
}
int main()
{
string s;
cin >> s;
bool value = isReductantBracket(s);
if(value)
{
cout << "The brackets are reductant." << endl;
}
else
{
cout << "The brackets are not reductant." << endl;
}
return 0;
}