栈式应用举例-数制转换和后缀表达式求值

//数制转换  N=(N div d)*d+N mod d
void conversion(int N,int n)
{
	SqStack S; 
	InitStack(S);
	//scanf("%d", &N);
	while (N)
	{
		int temp = N % n;
		push(S,temp);
		N /= n;
		
	}
	while( !StackEmpty(S))
	{
		int e;
	     pop(S,e);
		printf("%d", e);
	}
}
*/

/*
//中缀表达式“3*2^（4+2*2-1*3）-5 ”的后缀表达式为：“32422*+13 * -^*5 - ”
//后缀表达式求值
//typedef char SElemType;
double calcu_expr(char *A)
{
	SqStack S; int a, b, c;char result;
	InitStack(S);
	char ch = *A;
	A++;
	while (ch != '#')
	{
		if (ch != '+' || ch != '-' || ch != '*' || ch != '/')
		{
			push(S, ch);
			
		}
		else
		{
			
			pop(S, &a); pop(S, &b);
			switch (ch)
			{
				
			case '+':c = a + b; break;
			case '-':c = a - b; break;
			case '*':c = a * b; break;
			case '/':c = a / b; break;
			}
			push(S, c);
		}
		ch = *A++;
	}
	pop(S, result);
	printf("%s", result);
	return result;
}