栈的应用：中缀表达式转化为前缀表达式

@中缀表达式转化为前缀表达式（只含*±三个运算符）

// Created by leo_frank on 2019/3/24.
//
#include
#include
#include
#include
#include
#include
using namespace std;

bool check(char a ,char b )
{
if ( a == ‘+’ || a==’-’)
{
if ( b==’-’ || b == ‘+’) return true;
else return false;
}
else if ( a == ‘*’ )
{
return true ;
}
}
int main(int argc, const char * argv[]) {
char s[50];
scanf("%s",s);

stack < char > s1,s2;//s1是运算符栈，s2是操作数栈；
for ( int i = strlen(s)-1; i>=0; i--)
{
    if ( isdigit(s[i])) s2.push(s[i]);
    else if ( strchr("+-*",s[i])!=NULL )
    	{
        	if ( s1.empty() || s1.top() == ')' ) s1.push(s[i]);
        	else
            {
                if ( check(s[i],s1.top())) s1.push(s[i]);
                else
                {
                    while ( !(check(s[i],s1.top())) )
                    {   
                        s2.push(s1.top());
                        s1.pop();
                        if ( s1.empty() || (s1.top()==')') ) break;          //这一步比较重要，顺序不能提前。
                    }
                    s1.push(s[i]);          //while循环结束后不要忘了push。
                }
            }
    	}
    else if ( s[i] == ')' ) s1.push(s[i]);
    else if ( s[i] == '(' )
    {
        while ( s1.top()!=')') { s2.push(s1.top());s1.pop();}
		s1.pop();
    }
}
while ( !s1.empty())
    {
        s2.push(s1.top());
        s1.pop();
    }
while ( !s2.empty())
    {  	cout << s2.top();
        s2.pop();
    }
    cout << endl;


return 0;

}