{
OPS[j++] = OPE.pop(); i--; } else
OPE.push(S[i]); } else {
while ((S[i] >= '0'&&S[i] <= '9' )|| S[i] == '.'||('-'==S[i]&&(S[i-1]<'0'||S[i-1]>'9'))) {
OPS[j++] = S[i]; if('-'==S[i])
OPS[j++]='@'; i++; } i--;
OPS[j++] = '#'; //数字中的间隔符 }
break; case'*': case'/': case'^': case'%':
OPE.push(S[i]); break; case'(':
OPE.push(S[i]); break; case')':
while (OPE.top() != '(') {
OPS[j++] = OPE.pop(); }
OPE.pop(); break; default:
while (S[i] >= '0'&&S[i] <= '9' || S[i] == '.'||('-'==S[i]&&S[i-1]<'0'&&S[i-1]>'9')) {
OPS[j++] = S[i]; i++; }
i--;
OPS[j++] = '#'; //数字中的间隔符 break; } }
while (!OPE.isEmpty()) {
OPS[j++] = OPE.pop(); }
len = j; return 0; }
//计算后缀表达式
int Caculator::evaluation(char B[], int len, double &result, bool &flag) {
int i; double a; double b; double c;
QStack
switch (B[i]) {
case'+': {
a = SZ.pop(); b = SZ.pop(); c = b + a; SZ.push(c); }
break; case'-': {
if('@'!=B[i+1]) {
a = SZ.pop(); b = SZ.pop(); c = b - a; SZ.push(c); } else {
int jx = 0;
double dx;
char *stx = new char[10]; while (B[i] != '#') {
if('@'!=B[i])
stx[jx++] = B[i]; i++;
}
dx = atof(stx); SZ.push(dx); delete stx; } }
break; case'*': {
a = SZ.pop(); b = SZ.pop(); c = b*a; SZ.push(c); }
break; case'^': {
a = SZ.pop(); b = SZ.pop(); c = pow(b,a); SZ.push(c); }
break; case'/': {
a = SZ.pop(); b = SZ.pop(); if (a== 0) {
flag = false; return 0; }
c = b / a; SZ.push(c); }
break;
case'%': {
a = SZ.pop(); b = SZ.pop(); if (a== 0) {
flag = false; return 0; }
c = (int)b % (int)a; SZ.push(c); }
break; default:
int j = 0; double d;
char *st = new char[10]; while (B[i] != '#') {
st[j++] = B[i]; i++; }
d = atof(st); SZ.push(d); delete st; break; } }
result=SZ.top(); return 0; }
main.cpp源文件 #include \#include
int main(int argc, char *argv[]) {
QApplication a(argc, argv); Caculator w; w.show();
return a.exec(); }
程序运行截图
1.加减乘除四则运算
2.x^n