求解逆波兰式（求后缀表达式）

先上源代码

// An highlighted block
#include<cstdio>
#include<cstring>
#include<string>


using namespace std;
#define maxSize 50
int j = 0;
int main()
{
	double cal(double exp[], int k);//计算函数
	double op(double a, char Op, double b);
	char infix[maxSize];
	gets_s(infix);
	double s[maxSize] = {0};
	int k = strlen(infix); 
	for (int i = 0; i < k; ++i)
	{

		if (infix[i] != ' ') 
		{
			if (infix[i] <= '9' && infix[i] >= '0')
			{
				while (infix[i] != ' ' && infix[i] != '\0')//用空格区分5010这种情况：50 10
				{
					s[j] = 10 * s[j] + infix[i] - '0';
					++i;
				}
				--i;
				++j;
			}
			else if (infix[i] != '\0')
			{
				s[j++] = infix[i]-'0';
			}
		}
	}
	printf("%.2f", cal(s, k));
	return 0;
}
double op(double a, char Op, double b)//运算函数 
{
	if (Op == '+') return a + b;
	if (Op == '-') return a - b;
	if (Op == '*') return a * b;
	if (Op == '/')//题目是非负整数
	{
		if (b == 0)
		{
			printf("error\n");
			return 0;
		}
		else
			return a / b;
	}
}
double cal( double exp[], int k)//后缀式计算函数 
{
	int i, temp=0;
	double a, b, c;
	double stack[maxSize]; int top = -1;

	char Op;
	for (i = 0; i <j ; ++i)
	{
		if (exp[i] < 0)//为符号
		{
			Op = exp[i]+'0';
			b = stack[top--];
			a = stack[top--];//后进先出
			c = op(a, Op, b);
			stack[++top] = c;
		}
		else {
			stack[++top] = exp[i];
		}
	}
	return stack[top];
}

输入样例