-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconversion.cpp
More file actions
135 lines (114 loc) · 1.77 KB
/
conversion.cpp
File metadata and controls
135 lines (114 loc) · 1.77 KB
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
#include <iostream>
#include <cctype>
using namespace std;
#define MAX 5
class Stack
{
private:
int array[MAX];
int top;
public:
Stack(){top = -1;};
bool Push(int);
int Pop();
bool Empty();
bool Full();
int See_Top();
void Print();
};
bool Stack::Full()
{
if (top == MAX - 1)
{
return true;
}
return false;
}
bool Stack::Empty()
{
if (top == -1)
{
return true;
}
return false;
}
bool Stack::Push(int elem)
{
if (Full())
{
return false;
}
top++;
array[top] = elem;
return true;
}
int Stack::Pop()
{
if (Empty())
{
exit(0);
}
char tmp = array[top];
top--;
return tmp;
}
int Stack::See_Top()
{
if (Empty())
{
exit(0);
}
return array[top];
}
void Stack::Print()
{
for (int i = 0; i <= top; i++)
{
cout << array[i] << endl;
}
}
int operation(int a, int b, char op)
{
switch (op)
{
case '+':
return a + b;
break;
case '-':
return a - b;
break;
case '*':
return a * b;
break;
case '/':
return a / b;
break;
default:
exit(1);
break;
}
}
int main()
{
string input;
Stack s;
cout << "Introduzca la expresion: ";
cin >> input;
for (int i = 0; i < input.length(); i++)
{
int op1, op2, tmp;
cout << input[i] << endl;
if (isdigit(input[i]))
{
tmp = (int) input[i];
s.Push(tmp);
}
else
{
op2 = s.Pop();
op1 = s.Pop();
s.Push(operation(op1, op2, input[i]));
}
}
cout << "Resultado: " << s.Pop();
}