表达式求值

方法一：用两个栈分别记录字符和数字，在根据优先级进行运算（请自行创建栈）

ST* s1 = NULL;//存放符号
ST* s2 = NULL;//存放数字
int prior(char ch)
{
	if (ch == '*' || ch == '/')
		return 3;
	else if (ch == '+' || ch == '-')
		return 2;
	else if (ch == '(' || ch == ')')
		return 1;
	else if (ch == '#')
		return 0;
}

//用来计算的函数（个人觉得比较冗余可以优化）
void Cal()
{
	char tmp = StackTop(s1);
	int x1, x2;
	switch (tmp)
	{
	case '+':
		x1 = StackTop(s2); StackPop(&s2);
		x2 = StackTop(s2); StackPop(&s2);
		StackPush(&s2, x1 + x2);
		break;
	case '-':
		x1 = StackTop(s2); StackPop(&s2);
		x2 = StackTop(s2); StackPop(&s2);
		StackPush(&s2, x2 - x1);//注意顺序
		break;
	case '*':
		x1 = StackTop(s2); StackPop(&s2);
		x2 = StackTop(s2); StackPop(&s2);
		StackPush(&s2, x1 * x2);
		break;
	case '/':
		x1 = StackTop(s2); StackPop(&s2);
		x2 = StackTop(s2); StackPop(&s2);
		StackPush(&s2, x2 / x1);//注意顺序
		break;
	}
}

//遍历表达式，并进行运算
int GetValue(char p[])
{
	int i = 0;
	StackPush(&s1, '#');
	while (p[i])
	{
		int sum = 0;
		//将数字整个放入s2栈中
		while (isdigit(p[i]))
		{
			sum = sum * 10 + p[i] - '0';
			i++;
			if (!(isdigit(p[i])))
			{
				StackPush(&s2,sum);
				break;
			}
		}
		//注意表达式的结尾必然是数字或者')'，这里要判断，防止越界
        //')'不用在这里判断，下面要用到进行计算
        if (!p[i])
			break;
		char tmp;
		switch (p[i])//判断符号
		{
		case '('://'('直接进栈
			StackPush(&s1, '(');
			break;
		case ')'://遇到')'要将括号内的值进行计算
			tmp = StackTop(s1);
			while (tmp != '(')
			{
				Cal();
				StackPop(&s1);
				tmp = StackTop(s1);
			}
			StackPop(&s1);//删除'('
			break;
		default:
			//处理数据
			tmp = StackTop(s1);
            //如果符号的优先级高，直接进栈
			if (prior(p[i]) > prior(tmp))
			{
				StackPush(&s1, p[i]);
			}
			else//否则将比该符号优先级高或相同优先级的符号全部计算完
			{
				while (prior(p[i]) <= prior(tmp))
				{
					Cal();
					StackPop(&s1);
					tmp=StackTop(s1);
				}
				StackPush(&s1,p[i]);//最后不要忘记将该符号进栈
			}
			break;
		}
		i++;
	}
    //将栈里的数字全部进行运算得到最终结果
	char tmp;
	while ((tmp = StackTop(s1)) != '#')
	{
		Cal();
		StackPop(&s1);
		tmp = StackTop(s1);
	}
	return StackTop(s2);
}
int main()
{
	char ch[100] = { 0 };
	gets(ch);
	int ret=GetValue(ch);
	printf("%d",ret);
	return 0;
}

方法二：后缀表达式

后缀表达式就是将数字和符号按一定的顺序排列，使得该表达式的运算优先级不变，方便计算

ST* s = NULL;
//求后缀表达式的结果
int get_value(char a[])
{
	int i = 0; int x1, x2;
	while (a[i]!='#')
	{
		switch (a[i])
		{
		case '+':
			x1 = StackTop(s); StackPop(&s);
			x2 = StackTop(s); StackPop(&s);
			StackPush(&s, x1 + x2);
			break;
		case '-':
			x1 = StackTop(s); StackPop(&s);
			x2 = StackTop(s); StackPop(&s);
			StackPush(&s, x2 - x1);//注意顺序
			break;
		case '*':
			x1 = StackTop(s); StackPop(&s);
			x2 = StackTop(s); StackPop(&s);
			StackPush(&s, x1 * x2);
			break;
		case '/':
			x1 = StackTop(s); StackPop(&s);
			x2 = StackTop(s); StackPop(&s);
			StackPush(&s, x2 / x1);//注意顺序
			break;
		default:
			StackPush(&s,a[i]-'0');
		}
		i++;
	}
	int ret = StackTop(s);
	StackDestroy(&s);
	return ret;
}


//符号的优先级
int prior(char ch)
{
	if (ch == '+' || ch == '-')
		return 2;
	else if (ch == '*' || ch == '/')
		return 3;
	else if (ch == '('||ch==')')
		return 1;
	else if (ch == '#')
		return 0;
}
//翻译出后缀表达式
void translate(char ch[],char a[])
{
	int i = 0, k = 0;
	int len = strlen(ch);;
	ch[len] = '#';
	ch[len + 1] = '\0';
	StackPush(&s, '#');
	while (ch[i])
	{
		if (isdigit(ch[i]))
			a[k++] = ch[i];
		else
		{
			char tmp;
			switch (ch[i])
			{
			case '(':
				StackPush(&s, '(');
				break;
			case ')':
				tmp = StackTop(s);
				while (tmp != '(')
				{
					a[k++] = tmp;
					StackPop(&s);
					tmp = StackTop(s);
				}
				StackPop(&s);//把'('去掉
				break;
			default:
				tmp = StackTop(s);
				while (prior(tmp) >= prior(ch[i]))
				{
					
					a[k++] = tmp;
					StackPop(&s);
					if (tmp == '#')
						break;
					else
						tmp = StackTop(s);
				}
				if (ch[i] != '#')
					StackPush(&s, ch[i]);
				break;
			}
		}
		i++;
	}	
	a[k] = '\0';
}

int main()
{
	char ch[100] = { 0 };
	char a[100] = { 0 };
	gets(ch);
	translate(ch,a);
	int result = get_value(a);
	printf("%d",result);
	return 0;
}