-
Notifications
You must be signed in to change notification settings - Fork 113
/
Copy pathExpression Evaluation.txt
66 lines (62 loc) · 1.09 KB
/
Expression Evaluation.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
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool isOperator(char ch)
{
if (ch == '+' || ch == '-' || ch == '*' || ch == '/')
return true;
else
return false;
}
int performOperation(int op1, int op2, char op)
{
int ans;
switch (op) {
case '+':
ans = op2 + op1;
break;
case '-':
ans = op2 - op1;
break;
case '*':
ans = op2 * op1;
break;
case '/':
ans = op2 / op1;
break;
}
return ans;
}
int main()
{
char exp[1000], buffer[15];
int i, op1, op2, len, j, x;
stack<int> s;
cout<<"Enter a Postfix Expression: ( e.g. 4 5 * )\n";
cin.getline(exp,1000);
len = strlen(exp);
j = 0;
for (i = 0; i < len; i++) {
if (exp[i] >= '0' && exp[i] <= '9') {
buffer[j++] = exp[i];
}
else if (exp[i] == ' ') {
if (j > 0) {
buffer[j] = '\0';
x = atoi(buffer);
s.push(x);
j = 0;
}
}
else if (isOperator(exp[i])) {
op1 = s.top();
s.pop();
op2 = s.top();
s.pop();
s.push(performOperation(op1, op2, exp[i]));
}
}
cout<<"Answer = "<<s.top();
return 0;
}