逆波兰式

Description

假设表达式由单字母变量和双目四则运算算符构成。试编写程序，将一个通常书写形式且书写正确的表达式转换为逆波兰式。

Input

输入由单字母变量和双目四则运算算符构成的表达式。

Output

输出其逆波兰式。

• Sample Input 

  (a+b)*c

• Sample Output

  ab+c*

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

typedef struct list
{
	char s;
	struct list* next;
}list;

typedef struct stack
{
	struct list* bottom;
	struct list* top;
}stack;

void init(list* l,stack* s)
{
	l->next = NULL;
	l->s = '.';
	s->top = l;
	s->bottom = l;
}

void push(stack* stack,char c)
{
	list* lnew = (list* )malloc(sizeof(list));
	lnew->s = c;
	lnew->next = stack->top;
	stack->top = lnew;
}

char pop(stack* stack)
{
	list* p;
	p = stack->top->next;
	char c;
	c = stack->top->s;
	free(stack->top);
	stack->top = p;
	return c;
}

int superior(char m,char n)//优先级表示，1表示优先级高，0表示低，2表示相等
{
	int k[6][6] = 
	{1,1,0,0,0,1,
	 1,1,0,0,0,1,
	 1,1,1,1,0,1,
	 1,1,1,1,0,1,
	 0,0,0,0,0,2,
	 1,1,1,1,-1,1};
	if(n == '.')
	{
		return 1;
	}
	else
	{
		int a = 0,b = 0;
		if(m == '+') a = 0;
		if(m == '-') a = 1;
		if(m == '*') a = 2;
		if(m == '/') a = 3;
		if(m == '(') a = 4;
		if(m == ')') a = 5;
		if(n == '+') b = 0;
		if(n == '-') b = 1;
		if(n == '*') b = 2;
		if(n == '/') b = 3;
		if(n == '(') b = 4;
		if(n == ')') b = 5;
		return k[a][b];
	}
}

int main()
{
	list* head = (list* )malloc(sizeof(list));
	stack* pstack = (stack* )malloc(sizeof(stack));
	init(head,pstack);
	char s;
	char m[1000];//利用字符数组存储输出数据
	int i, step = 0;
	
	while(1)
	{
		scanf("%c",&s);
		
		if(s == '\n')
		{
			break;
		}
		if(s >= 65 && s <= 90 || s >= 97 && s <= 122)//如果是字符，直接输出
		{
			m[step] = s;
			step++;
			continue;
		}
		if(s == '(')//如果是‘（’，入栈
		{
			push(pstack,s);
			continue;
		}
		if(s == ')')//如果是‘）’，将栈顶元素出栈，直到遇到‘（’（出栈但不输出）
		{
			while(pstack && pstack->top->s != '(')
			{
				//printf("%c", pstack->top->s);
				m[step] = pop(pstack);
				step++;
			}
			pop(pstack);
			continue;
		}
		if(superior(s,pstack->top->s) == 1)
		{
			push(pstack,s);
			continue;
		}
		else
		{
			while(superior(s,pstack->top->s) != 1 && pstack->top->s != '(')
			{
				m[step] = pop(pstack);
				step++;
			}
			push(pstack,s);
		}
	}
	
	for(i = 0;i < step;i++)
	{
		printf("%c",m[i]);
	}
	while(pstack->top != pstack->bottom)
	{
		printf("%c",pstack->top->s);
		pstack->top = pstack->top->next;
	}
	
	printf("\n");
	return 0;
}