forked from iam-abbas/cs-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reverse Polish Expression.txt
75 lines (73 loc) · 1.65 KB
/
Reverse Polish Expression.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
#include<bits/stdc++.h>
using namespace std;
int priority(char c)
{
if(c=='*' || c=='/')
return 1;
else if(c=='+' || c=='-')
return 2;
}
bool isOperator(char c)
{
if(c == '+' || c=='-' || c=='*' || c=='/')
return true ;
else
return false ;
}
string infix_to_postfix(string s)
{
s = "("+s+")" ;
stack<char> st ;
string ans = "" ;
for(int i=0;i<s.size();i++)
{
if(s[i] == '(')
st.push(s[i]) ;
else if(!isOperator(s[i]) && s[i] != ')')
{
string x(1,s[i]);
ans+=x;
}
else if(isOperator(s[i]))
{
char x = st.top() ;
if(isOperator(x))
{
if(priority(x)<priority(s[i]))
{
string ch(1,x);
ans+=ch ;
st.pop() ;
st.push(s[i]);
}
else
{
st.push(s[i]);
}
}
else
st.push(s[i]);
}
else if(s[i] == ')')
{
while(st.top() != '(')
{
char x = st.top() ;
string ch(1,x) ;
ans+=ch ;
st.pop() ;
}
st.pop() ;
}
}
return ans ;
}
int main()
{
string s ;
cout<<"Enter the In-Fix Expression : " ;
cin>>s ;
string ans = infix_to_postfix(s) ;
cout<<endl<<"Required Reverse Polish Expression (Post-Fix Expression) :- "<<ans ;
return 0 ;
}