• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>

    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>

            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            

    
            

            




            







												


        


            


            The Fourth Dimension Space
            

            枯葉北風(fēng)寒，忽然年以殘，念往昔，語(yǔ)默心酸。二十光陰無(wú)一物，韶光賤，寐難安； 不畏形影單，道途阻且慢，哪曲折，如渡飛湍。斬浪劈波酬壯志，同把酒，共言歡！  -如夢(mèng)令
            

            




            
	
					
	
            
		
            
			中綴表達(dá)式轉(zhuǎn)化為后綴表達(dá)式
		
            
		
            //Copyright by abilitytao

            //All right not reserved!!

             

             

            #include             <process.h>

            #include             <iostream.h>

            #include             <conio.h>

            #include             <stdlib.h>

            #include             <math.h>

            #include             <stack>

            #include             <cstring>

            #include             <ctype.h>

            using namespace std;

             

            struct formula

            {

                               char numormark[100];

            }            ;

             

            /**////////////////////////////////////////////////////////////

            /////////////////////定義problem類(lèi)/////////////////////////

            ///////////////////////////////////////////////////////////

             

            class Aeasyproblem

            {

            private:

                               int formulalen;

                               char temp[1000];

                   formula             in[1000];

                   formula pos[            1000];

            public:

                               void inputtheformula();

                               void intoin();//用于將中綴表達(dá)式放入結(jié)構(gòu)體數(shù)組，從而實(shí)現(xiàn)數(shù)字與運(yùn)算符的分離；

                               void intopos();//用于將中綴表達(dá)式轉(zhuǎn)化成后綴表達(dá)式；

                               void showthepos();

            }            ;

             

            void Aeasyproblem::inputtheformula()

            {

                   cin            >>temp;

            }

            void Aeasyproblem::intoin()//這是用于解析輸入的字符串的函數(shù)，將算式中的每個(gè)個(gè)體存入自己聲明的結(jié)構(gòu)體中；

            {

                   formulalen            =0;

                               int templen;

                               int temlen;

                               char tem[100];

             

                  

                   templen            =strlen(temp);

                               int i;

                               int j;

                   j            =0;

                               for(i=0;i<templen;i+=temlen)

                               {

                                      if(isdigit(temp[i]))

                                      {

                                 sscanf(            &temp[i],"%[^-^+^*^/^(^)]",tem);

                                 temlen            =strlen(tem);

                                 strcpy(            in[j].numormark,tem);

                                 formulalen            ++;

                                 j            ++;

                          }

                                      else

                                      {

                                 temlen            =1;

                                             in[j].numormark[0]=temp[i];

                                             in[j].numormark[1]='\0';

                                 formulalen            ++;

                                 j            ++;

                          }

                   }

            }

             

             

             

             

            void Aeasyproblem::intopos()//這是用于將中綴表達(dá)式轉(zhuǎn)化成后綴表達(dá)式的函數(shù)

            {

                               /**//////////////////'(' ')''+''-''*''/''='

                               static int isp[7]={ 0,19,12,12,13,13,0};

                               static int icp[7]={20,19,12,12,13,13,0};

                               int precedence_sta;

                               int precedence_token;

             

                   stack            <formula>sta;

                               int i;

                               int j;

                               char token[100];

                   formula start;

                   strcpy(start.numormark,            "\0");

                   sta.push(start);

                   j            =0;

                               for(i=0;i<formulalen;i++)

                               {

                         

                          strcpy(token,            in[i].numormark);

                                      if(strcmp(token,"\0")==0)

                                             break;

                                      if(isdigit(token[0]))

                                      {

                                 strcpy(pos[j].numormark,token);

                                 j            ++;

                          }

                                      else if(strcmp(token,")")==0)

                                      {

                                             while(strcmp(sta.top().numormark ,"(")!=0)

                                             {

                                        strcpy(pos[j].numormark,sta.top().numormark);

                                        j            ++;

                                        sta.pop();

                                 }

                                 sta.pop();

                          }

                                      else

                                      {

                                                    if(strcmp(sta.top().numormark,"(")==0)

                                               precedence_sta            =0;

                                                    if(strcmp(sta.top().numormark,")")==0)

                                               precedence_sta            =19;

                                                    if(strcmp(sta.top().numormark,"+")==0)

                                               precedence_sta            =12;

                                                    if(strcmp(sta.top().numormark,"-")==0)

                                               precedence_sta            =12;

                                                    if(strcmp(sta.top().numormark,"*")==0)

                                               precedence_sta            =13;

                                                    if(strcmp(sta.top().numormark,"/")==0)

                                               precedence_sta            =13;

                                                    if(strcmp(sta.top().numormark,"\0")==0)

                                               precedence_sta            =0;

                                                    if(strcmp(token,"(")==0)

                                               precedence_token            =20;

                                                    if(strcmp(token,")")==0)

                                               precedence_token            =19;

                                                    if(strcmp(token,"+")==0)

                                               precedence_token            =12;

                                                    if(strcmp(token,"-")==0)

                                               precedence_token            =12;

                                                    if(strcmp(token,"*")==0)

                                               precedence_token            =13;

                                                    if(strcmp(token,"/")==0)

                                               precedence_token            =13;

                                                    if(strcmp(token,"\0")==0)

                                               precedence_token            =0;

                                             while(precedence_sta>=precedence_token)

                                             {

                                               pos[j]            =sta.top();

                                               j            ++;

                                               sta.pop();

                                                    if(strcmp(sta.top().numormark,"(")==0)

                                               precedence_sta            =0;

                                                    if(strcmp(sta.top().numormark,")")==0)

                                               precedence_sta            =19;

                                                    if(strcmp(sta.top().numormark,"+")==0)

                                               precedence_sta            =12;

                                                    if(strcmp(sta.top().numormark,"-")==0)

                                               precedence_sta            =12;

                                                    if(strcmp(sta.top().numormark,"*")==0)

                                               precedence_sta            =13;

                                                    if(strcmp(sta.top().numormark,"/")==0)

                                               precedence_sta            =13;

                                                    if(strcmp(sta.top().numormark,"\0")==0)

                                               precedence_sta            =0;

                                                    if(strcmp(token,"(")==0)

                                               precedence_token            =20;

                                                    if(strcmp(token,")")==0)

                                               precedence_token            =19;

                                                    if(strcmp(token,"+")==0)

                                               precedence_token            =12;

                                                    if(strcmp(token,"-")==0)

                                               precedence_token            =12;

                                                    if(strcmp(token,"*")==0)

                                               precedence_token            =13;

                                                    if(strcmp(token,"/")==0)

                                               precedence_token            =13;

                                                    if(strcmp(token,"\0")==0)

                                               precedence_token            =0;

                                 }

                                 strcpy(start.numormark,token);

                                

                                        sta.push(start);

                          }

                   }

                               while(strcpy(token,sta.top().numormark))

             

                               {

                                      if(strcmp(token,"\0")==0)

                                             break;

                          pos[j]            =sta.top();

                          j            ++;

                          sta.pop();

                   }

                   strcpy(pos[j].numormark,            "\0");

             

            }

             

            void Aeasyproblem::showthepos()

            {

                               int i;

                               for(i=0;strcmp(pos[i].numormark,"\0")!=0;i++)

                               {

                         

                          cout            <<pos[i].numormark<<' ';

             

                   }

                   cout            <<'\b'<<endl<<endl;

                  

            }

            /**////////////////////////////////////////////////////////////////////////////////////////////////

            ////////////////////////////////Problem類(lèi)定義完成/////////////////////////////////////////////

            //////////////////////////////////////////////////////////////////////////////////////////////

             

             

             

            int main ()

            {

                   Aeasyproblem justforfun;

                               while(1)

                               {

                          justforfun.inputtheformula();

                          justforfun.intoin();

                          justforfun.intopos();

                          justforfun.showthepos();

                   }

                               return 0;

            }
            

		
            
			posted on 2009-07-14 16:37 abilitytao 閱讀(407) 評(píng)論(0)  編輯 收藏 引用  
		
            
	
            
	
	





            
	    
    




            



            


            

	
            
		
		
            只有注冊(cè)用戶(hù)登錄后才能發(fā)表評(píng)論。
            
		
            
		
				
		
		
		
            
		
            			
		
		
		
		
            
		
            
			
		
            
		
            
			
		
            
		
            
			
            網(wǎng)站導(dǎo)航:
			博客園  
			IT新聞  
			BlogJava  			
			博問(wèn)  
			Chat2DB  
			管理
			
            		
		
            
		
            
			
				

            


            

            		
		
            
	
            	

            



            

				

            


    
    







            
	   
	



久久精品国产WWW456C0M|
亚洲欧美另类日本久久国产真实乱对白
|
狠狠久久综合伊人不卡|
99久久人妻无码精品系列蜜桃
|
久久精品亚洲中文字幕无码麻豆|
久久亚洲中文字幕精品一区|
久久毛片免费看一区二区三区|
精品99久久aaa一级毛片|
国产高清美女一级a毛片久久w|
久久精品国产亚洲一区二区|
国产精品久久久久影院嫩草|
欧洲精品久久久av无码电影|
男女久久久国产一区二区三区|
超级碰碰碰碰97久久久久|
伊人久久大香线蕉综合热线|
婷婷久久综合九色综合九七|
久久毛片一区二区|
久久亚洲国产精品成人AV秋霞|
久久无码国产专区精品|
麻豆成人久久精品二区三区免费|
久久亚洲精品国产精品|
99国产精品久久|
国产福利电影一区二区三区久久老子无码午夜伦不
|
久久久久久极精品久久久|
久久精品国产一区二区三区|
久久青青草原亚洲av无码|
久久久久av无码免费网|
婷婷五月深深久久精品|
国产精品久久久久久影院|
国产精品成人99久久久久91gav|
2021国产成人精品久久|
中文字幕久久亚洲一区|
久久免费的精品国产V∧|
亚洲国产精品久久久久婷婷软件|
国产精久久一区二区三区|
四虎影视久久久免费|
久久99精品久久久久久hb无码|
亚洲国产二区三区久久|
欧美激情一区二区久久久|
久久国产乱子伦精品免费强|
99久久精品免费观看国产|