DataStructAndAlgorithmClass/2022-04-21.cpp at master · hun1001/DataStructAndAlgorithmClass · GitHub

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
#include <iostream>
#include <string>
#include <stack>
using namespace std;

int main()
{
	stack<int> st;
	string mathE;
	int result(0);
	int iMemory;
	char cMemory;

	getline(cin, mathE);
	for (int i = 0; i < mathE.length(); i++)
	{
		cMemory = mathE[i];
		iMemory = 0;
		switch (cMemory)
		{
		case '+':
			iMemory = st.top();
			st.pop();
			iMemory += st.top();
			st.pop();
			st.push(iMemory);
			break;
		case '-':
			iMemory = st.top();
			st.pop();
			iMemory -= st.top();
			st.pop();
			st.push(iMemory >= 0 ? iMemory : iMemory * -1);
			break;
		case '*':
			iMemory = st.top();
			st.pop();
			iMemory *= st.top();
			st.pop();
			st.push(iMemory);
			break;
		case '/':
		{
			iMemory = st.top();
			st.pop();
			int iMemoryT = st.top();
			st.pop();
			st.push(iMemoryT / iMemory);
		}
			break;
		default:
			switch (cMemory)
			{
			case '0':
			case '1':
			case '2':
			case '3':
			case '4':
			case '5':
			case '6':
			case '7':
			case '8':
			case '9':
				st.push(cMemory - '0');
				break;
			default:
				break;
			}
			break;
		}
	}

	while (!st.empty())
	{
		cout << st.top();
		st.pop();
	}
}