菜鸡求助！编译环境是vs，想利用堆栈解决，表达式求和陷入死循环，谢谢大神们帮忙。感激不尽！

2020-11-10 09:45:20 208 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

LAMP vs MEAN：哪种技术堆栈才是您的菜？最流行的两种选择是 LAMP 和MEAN。两者都是开源堆栈，具有灵活性和易用性，是构建动态网络应用程序的强大基础。本文将比较这两种堆栈的优缺点，帮助您选择适合自己项目的堆栈。阅读详情

#include <stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>

#define INIT 100

struct SNode
{
char* Base;
char* Top;
int Maxsize;
};

struct Node
{
double* base;
double* top;
int maxsize;
};

void CreateStack(SNode& S)
{
S.Base = (char*)malloc(INIT * sizeof(char));
if (!S.Base)
{
printf("error!\n");
}
else
{
S.Top = S.Base;
S.Maxsize = INIT;
}
}

void CreateTack(Node& S)
{
S.base = (double*)malloc(INIT * sizeof(double));
if (!S.base)
{
printf("error!\n");
}
else
{
S.top = S.base;
S.maxsize = INIT;
}
}

void PushStack(SNode& S, char X)
{
*S.Top = X;
S.Top++;
}

void PushTack(Node& S, float X)
{
*S.top = X;
S.top++;
}

char PopStack(SNode& S)
{
S.Top--;
return (*S.Top);
}

float PopTack(Node& S)
{
S.top--;
return (*S.top);
}

char GetStackTop(SNode S)
{
char e;
e = *(S.Top--);
return e;
}

float GetTackTop(Node S)
{
char e;
e = *(S.top--);
return e;
}

int Judge(char a)
{
if (a == '+' || a == '-' || a == '*' || a == '/' || a == '(' || a == ')' || a == '#')
return 1;
else
return 0;
}

double Operate(double a, char theta, double b)
{
double end = 0;
switch (theta)
{
case '+':
end = a + b;
break;
case '-':
end = a - b;
break;
case '*':
end = a * b;
break;
case '/':
end = a / b;
break;
}
return end;
}

char Compare(char a, char b)
{
char e;
switch (a)
{
case '+':
if (b == '+' || b == '-' || b == ')' || b == '#')
e = '>';
else
e = '<';
break;
case '-':
if (b == '+' || b == '-' || b == ')' || b == '#')
e = '>';
else
e = '<';
break;
case '*':
if (b == '(')
e = '<';
else
e ='>';
break;
case '/':
if (b == '(')
e = '<';
else
e = '>';
break;
case '(':
if (b == ')')
e = '=';
else
e = '<';
break;
case ')':
e = '>';
break;
case '#':
if (b == '#')
e = '<';
else if (b == ')')
e = '!';
else
e = '=';
break;
}
}

int main(int argc, char* argv[])
{
double num, x = 0, y = 0;
int i = 0, j = 0;
char TmpData[20];
char theta, c;
SNode OPTR;
Node OPND;

CreateStack(OPTR);
PushStack(OPTR, '#');
CreateTack(OPND);
c = argv[1][j];

while (c != '#' || GetStackTop(OPTR) != '#')
{
printf("2");
if (Judge(c) == 0)
{
TmpData[i] = c;
i++;
j++;
c = argv[1][j];
if (Judge(c) == 1)
{
TmpData[i] = '\0';
num = atof(TmpData);
PushTack(OPND, num);
i = 0;
}
}

else
switch (Compare(GetStackTop(OPTR), c))
{
case '<':
PushStack(OPTR, c);
j++;
c = argv[1][j];
break;
case '=':
PopStack(OPTR);
j++;
c = argv[1][j];
break;
case '>':
theta = PopStack(OPTR);
y = PopTack(OPND);
x = PopTack(OPND);
PushTack(OPND, Operate(x, theta, y));
break;
}
}
printf("%g", GetTackTop(OPND));
return 0;
}

...全文