C语言实现逆波兰法计算表达式

主体：两个函数

	transMtoA(std,stdA);//将中缀表达式->后缀表达式
	caculate(stdA,stacknum);//计算结果

注意！！！ 减法和除法时stack[top - 2] - stack[top - 1]！！！
全部代码：

#include<stdio.h> 
int cur = 0;
int isDigit(char* s) {
	return s >= '0' && s <= '9';
}
int getBit(int num) {
	int count = 0;
	while(num > 0) {
		num = num/10;
		count++;
	}
	return count;
}
int getPri(char op) {
	switch(op){
		case '+':return 1;
		case '-':return 1;
		case '*':return 2;
		case '/':return 2;
		case '(':return 0;
		default: return 0;
	}
}
void transMtoA(char* strM,char* strA) {
	int i;
	char out[100] = {0};
	int  lo = 0;
	
	char stack[100] = {0};
	int top = 0;
	
	for(i = 0;i < strlen(strM);i++) {
		if(isDigit(strM[i])) {
			out[lo++] = strM[i];
		}else if(strM[i] == '(') {
			stack[top++] = strM[i];
		}else if(strM[i] == ')') {
			while(top > 0 && stack[top - 1] != '(') {
				out[lo++] = stack[top - 1];
				top--;
			}
			top--;//弹出左括号 
		}else {
			if(getPri(strM[i]) > getPri(stack[top - 1])) {
				stack[top++] = strM[i];
			}else {
				while( top > 0 && getPri(stack[top - 1]) >= getPri(strM[i]) ) {
					out[lo++] = stack[top - 1];
					top--;	
				}
				stack[top++] = strM[i];
			}
		} 
	} 
	while(top > 0) {
		out[lo++] = stack[top - 1];
		top--;
	}
	strcpy(strA,out);
	return;
}
void caculate(char* stdA,int* stacknum) {
	double stack[100] = {0};
	int top = 0;
	int cur = 0;
	int count = 0;
	double tmp = 0;
	while(cur < strlen(stdA)) {
		if(isDigit(stdA[cur])) {
			stack[top++] = (double)stacknum[count];
			cur = cur+getBit(stacknum[count]);
			count++;
		}else {
			switch (stdA[cur]){
				case '+' : 
					tmp = stack[top - 1] + stack[top - 2]; 
					//printf("%.2f + %.2f -> %.2f\n",stack[top - 1],stack[top - 2],tmp);
					top = top - 2; 
					stack[top++] = tmp;
					break;
				case '-' :
					tmp = stack[top - 2] - stack[top - 1];
					//printf("%.2f - %.2f -> %.2f\n",stack[top - 2],stack[top - 1],tmp);
					top = top - 2;
					stack[top++] = tmp;
					break;
				case '*' :
					tmp = stack[top - 1] * stack[top - 2];
					//printf("%.2f * %.2f -> %.2f\n",stack[top - 1],stack[top - 2],tmp);
					top = top - 2;
					stack[top++] = tmp;
					break;
				case '/' :
					tmp = stack[top - 2] / stack[top - 1];
					//printf("%.2f / %.2f -> %.2f\n",stack[top - 2],stack[top - 1],tmp);
					top = top - 2;
					stack[top++] = tmp;
					break;
				default:
				 	break;
			}
			cur++;
		}
	}
	printf("%.2f",stack[0]);
}
int main() {
	char str[100] = {0};
	char std[100] = {0};
	char stdA[100] = {0};
	int stacknum[100] = {0};
	int num = 0;
	int topN = 0;
	gets(str);
	int i;
	int length = 0;
	for(i = 0;i < strlen(str);i++) {
		if(str[i] == ' ') {
			continue;
		}else if(str[i] == '=') {
			continue;
		}else std[length++] = str[i];
	}
	std[length++] = '\0';
	int isNum = 0;
	//---------------------------------------
	i = 0;
	while(i < strlen(std)) {
		isNum = 0;
		while(isDigit(std[i])) {
			num = num*10 + std[i] - '0';
			i++;
			isNum = 1;
		}
		if(isNum) {
			stacknum[topN++] = num;
			num = 0;
			//printf("%d ",stacknum[topN - 1]);
		}else {
			i++;
		}
	}
	//-----------------------------------------
	//printf("\n");
	transMtoA(std,stdA);
	//printf("%s\n",stdA);
	caculate(stdA,stacknum);
	return 0;
}