-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
221 lines (200 loc) · 3.66 KB
/
main.cpp
File metadata and controls
221 lines (200 loc) · 3.66 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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
#include "SqStack.cpp"
#include <stdio.h>
char OP[] = "+-*/()#";
char DIGIT[] = "0123456789";
int cmp[7][7]=
{
1, 1,-1,-1,-1, 1, 1,
1, 1,-1,-1,-1, 1, 1,
1, 1, 1, 1,-1, 1, 1,
1, 1, 1, 1,-1, 1, 1,
-1,-1,-1,-1,-1, 0, ERROR,
1, 1, 1, 1, 0, 1, 1,
-1,-1,-1,-1,-1, ERROR, 0,
};
int Index(char c)
{
switch(c)
{
case '+':
return 0;
case '-':
return 1;
case '*':
return 2;
case '/':
return 3;
case '(':
return 4;
case ')':
return 5;
case '#':
return 6;
case '.':
return 10;
default:
exit(ERROR);
}
}
bool In(char c, char* set)
{
char *p = set;
while (*p)
{
if (c == *p) return true;
p++;
}
return false;
}
double Operate(double x, int op, double y)
{
switch(op)
{
case 0:
return x+y;
case 1:
return x-y;
case 2:
return x*y;
case 3:
return x/y;
default:
exit(ERROR);
}
}
int mGetchar()
{
char tmp[1024];
char buffer = getchar();
while (!In(buffer, OP) && !In(buffer, DIGIT) && buffer!='.')
{
printf("您的输入有误,请确保输入只包含数字和运算符号并以#结尾!\n");
if (buffer != '\n') gets(tmp);
return INPUT_VALID;
}
return buffer;
}
double E(double base, int exp)
{
double res = base;
for (int i=0; i<exp; i++)
{
res *= 10;
}
for (int i=0; i>exp; i--)
{
res /= 10;
}
return res;
}
double EvaExpression()
{
SqStack<int> OPTR;
SqStack<double> OPND;
int buffer;
bool preIsDigit = false;
bool hasDot = false;
int exp;
double ans = 0;
OPTR.Push(Index('#'));
buffer = mGetchar();
if (buffer == INPUT_VALID) return EvaExpression();
while (buffer!='#' || OPTR.GetTop()!=Index('#'))
{
if (buffer == '.')
{
if (hasDot)
{
char tmp_s[1024];
printf("您的输入有误,请确保输入的算术表达式合法!\n");
if (buffer != '\n') gets(tmp_s);
return EvaExpression();
}
hasDot = true;
exp = 0;
buffer = mGetchar();
if (buffer == INPUT_VALID) return EvaExpression();
}
else if (In(buffer, DIGIT))
{
if (preIsDigit)
{
double number;
OPND.Pop(&number);
if (hasDot)
{
exp--;
number += E(buffer-'0', exp);
}
else
{
number *= 10;
number += buffer-'0';
}
OPND.Push(number);
}
else
{
OPND.Push(buffer-'0');
preIsDigit = true;
}
buffer = mGetchar();
if (buffer == INPUT_VALID) return EvaExpression();
}
else
{
int toOperate, top;
preIsDigit = false;
hasDot = false;
toOperate = Index(buffer);
top = OPTR.GetTop();
switch(cmp[top][toOperate])
{
case -1:
OPTR.Push(toOperate);
buffer = mGetchar();
if (buffer == INPUT_VALID) return EvaExpression();
break;
case 0:
int tmp;
OPTR.Pop(&tmp);
buffer = mGetchar();
if (buffer == INPUT_VALID) return EvaExpression();
break;
case 1:
int op;
double a, b;
if (OPTR.Pop(&op) != OK || OPND.Pop(&b) != OK || OPND.Pop(&a) != OK)
{
char tmp_s[1024];
printf("您的输入有误,请确保输入的算术表达式合法!\n");
if (buffer != '\n') gets(tmp_s);
return EvaExpression();
}
ans = Operate(a, op, b);
OPND.Push(ans);
break;
case ERROR:
char tmp_s[1024];
printf("您的输入有误,请确保输入的算术表达式合法!\n");
if (buffer != '\n') gets(tmp_s);
return EvaExpression();
default:
exit(ERROR);
}
}
}
OPND.Pop(&ans);
if (OPTR.IsEmpty() || OPND.IsEmpty() ) return ans;
char tmp_s[1024];
printf("您的输入有误,请确保输入的算术表达式合法!\n");
if (buffer != '\n') gets(tmp_s);
return EvaExpression();
}
int main()
{
printf("输入运算式(以#号结束):\n");
double ans = EvaExpression();
printf("答案是:%lf", ans);
return 0;
}