栈的应用：中缀表达式转化为后缀表达式(逆波兰表达式)

#include 
#include 
#include 
#include "MyownStack.h"
using  namespace std;


const int Max = 1000;


int main()
{
    MyOwnStack  s;
    char c,e;


    cout<<"请输入中缀表达式，以#作为结束标志：\n";
    while(1){
        scanf("%c",&c);
        while(c >= '0'&&c <= '9'){
            cout<'9')
                cout<<" ";
        }
         if('#' == c)
            break;
        if(')' == c)
        while(1){
                e=s.Pop();
                if('(' == e)
                    break;
                cout<