10/01/20 Transform the Expression 解题报告

SPOJ Problem Set (classical) 4. Transform the Expression Problem code: ONP

 

Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Two-argument operators: +, -, *, /, ^ (priority from the lowest to the highest), brackets ( ). Operands: only letters: a,b,...,z. Assume that there is only one RPN form (no expressions like a*b*c).

Input

t [the number of expressions <= 100]
expression [length <= 400]
[other expressions]

Text grouped in [ ] does not appear in the input file.

Output

The expressions in RPN form, one per line.

Example

Input:
3
(a+(b*c))
((a+b)*(z+x))
((a+t)*((b+(a+c))^(c+d)))

Output:
abc*+
ab+zx+*
at+bac++cd+^*

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

#define length 400	/* 表达式字符串长度 */


int main(int argc, char **argv)
{
	int t, index=-1;	/* t代表测试用例, index代表栈的当前下标 */
	char exp[length+1], stack[length+1][length+1];	/* 使用一个栈计算逆波兰表达式 */
	char* ch;

	scanf("%d", &t);

	while (t--)
	{
		scanf("%s", &exp);	/* 读入中缀表达式 */
		ch=exp;
		index=-1;
		for (;*ch;ch++)	/* 对每个字符进行压栈操作 */
		{
			if(*ch!=')')	/* 由于题目指出只存在一次二元运算,因此可以简化,不考虑运算优先级,对于非()直接压栈 */
			{
				if (*ch=='(') continue;
				stack[++index][0] = *ch;
				stack[index][1] = '/0';
			}
			else	/* 每当遇到)就转换一个子表达式,并把结果压回栈中 */
			{
				char * second = stack[index--];
				char * op = stack[index--];
				char * first = stack[index];
				strcat(first,second);
				strcat(first, op);
			}
		}
		printf("%s/n", stack[0]);	/* 最后栈顶只有一个元素即最终的表达式结果 */
	}

	return 0;
}