• <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>
            C++博客 聯系 聚合 管理  

            Blog Stats

            隨筆檔案

            WarTalker


            題目要求基本如下:
            請編寫一個控制臺程序,要求用戶可以輸入任意組條件,定義兩個字母之間的大小關系。程序可以通過已輸入的條件,推斷出給定的兩個字母之間的大小關系。例如:
            用戶輸入:A>B
            用戶輸入:B>C
            用戶輸入:A?C
            程序顯示:A>C
            用戶輸入:C<D
            用戶輸入:A?D
            程序顯示:無法判斷
            用戶輸入:A<C
            程序顯示:與原有條件沖突




            #include <cstdlib>
            #include <iostream>

            using namespace std;
            /*
            *數組依次存放A-Z,并保存大于和小于該字母的字母鏈表
            */
            const int N = 26;
            struct CharNode
            {
                   CharNode( char n,CharNode* p):node(n),next(p){}
                   
                   char node;
                   CharNode* next;
            };
            struct ArrayNode
            {
                   int sign;
                   CharNode* up;
                   CharNode* down;
            };

            ArrayNode array[N];

            void Init( )
            {
                 for ( int i = 0; i < N; ++i )
                 {
                     array[i].sign = 0;
                     array[i].up = NULL;
                     array[i].down = NULL;
                 }
            };

            void Free( )
            {
                 CharNode* pChar = NULL;
                 for ( int i = 0; i < N; ++i )
                 {
                     pChar = array[i].up;
                     while( NULL != pChar )
                     {
                            array[i].up = pChar->next;
                            delete pChar;
                            pChar = array[i].up;
                     }
                     pChar = array[i].down;
                     while( NULL != pChar )
                     {
                            array[i].down = pChar->next;
                            delete pChar;
                            pChar = array[i].down; 
                     }
                 }
            };

            void Reset( )
            {
                 for ( int i = 0; i < N; ++i )
                 array[i].sign = 0;
            };




            void InsertNodeUp( char arraynode, char c )
            {
                 CharNode* pNode = new CharNode(c,NULL);
                 CharNode* pCharNode = array[arraynode-'A'].up;
                 if ( NULL != pCharNode )
                      pNode->next = pCharNode;
                     
                 array[arraynode-'A'].up = pNode; 
             
            };
            void InsertNodeDown( char arraynode, char c )
            {
                 CharNode* pNode = new CharNode(c,NULL);
                 CharNode* pCharNode = array[arraynode-'A'].down;
                 if ( NULL != pCharNode )
                      pNode->next = pCharNode;
                     
                 array[arraynode-'A'].down = pNode;  
            };




            bool _FindUp(  char source, char dest )
            {
                 if ( source == dest )
                    return true;
                
                 if ( 1 == array[source-'A'].sign )
                    return false;  

                 array[source-'A'].sign = 1;
                
                 CharNode* pChar = array[source-'A'].up;
               
                 while ( NULL != pChar )
                 {
                       if ( _FindUp(pChar->node,dest) )
                       return true;
                       pChar = pChar->next;
                 }
                 return false;
            };
            bool FindUp( char source, char dest )
            {
                 Reset( );
                 return _FindUp(source,dest);
            };



            bool _FindDown( char source, char dest )
            {   
                 if ( source == dest )
                 return true;
                
                 if ( 1 == array[source-'A'].sign )
                 return false;  
                 array[source-'A'].sign = 1;
                
                 CharNode* pChar = array[source-'A'].down;   
                 while ( NULL != pChar )
                 {
                       if ( _FindDown(pChar->node,dest) )
                       return true;
                       pChar = pChar->next;
                 }
                 return false;
            };
            bool FindDown( char source, char dest )
            {
                 Reset( );
                 return _FindDown(source,dest);
            };


            int main(int argc, char *argv[])
            {
                char first;
                char compare;
                char second;
                char minchar;
                 
                Init( );
               
                while( 1 )
                {
                       cin >> first >> compare >> second;
                       minchar = first < second ? first:second;
                       switch( compare )
                       {
                             case '>':
                             if ( FindUp(first,second) )
                             {
                                 cout << "Wrong" << endl;  
                                 break; 
                             }
                    
                             InsertNodeDown(first,second);
                             InsertNodeUp(second,first);                    
                             break;
                                                
                             case '<':                     
                             if ( FindDown(first,second) )
                             {
                                  cout << "Wrong" << endl;
                                  break;
                             }                                   

                             InsertNodeUp( first,second );
                             InsertNodeDown( second,first );             
                             break;
                                   
                             case '?':
                             if ( FindUp(first,second) )
                             {
                                  cout <<first<<'<'<<second<<endl;
                                  break;
                             }
                             if( FindDown(first,second) )
                             {
                                    cout<<first<<'>'<<second<<endl;
                                    break;
                             }
                             cout << "Unknown" << endl;   
                             break;
                               
                             case 'Q':
                             goto End;             
                       }        
                }
             
             End:  
                Free( );
               
                system("PAUSE");
                return EXIT_SUCCESS;
            }


            posted on 2007-06-30 16:52 WarTalker 閱讀(143) 評論(0)  編輯 收藏 引用
            伊人久久大香线蕉av一区| 精品久久久无码中文字幕天天| 很黄很污的网站久久mimi色 | 久久亚洲中文字幕精品一区四| 72种姿势欧美久久久久大黄蕉| 婷婷久久久亚洲欧洲日产国码AV | 麻豆久久久9性大片| 久久久久婷婷| 欧美精品丝袜久久久中文字幕 | 久久这里只有精品首页| 青青热久久国产久精品| 合区精品久久久中文字幕一区| 久久精品二区| 久久丫忘忧草产品| 久久午夜无码鲁丝片| 狠狠久久亚洲欧美专区| 一本久久a久久精品综合夜夜| 精品久久久久久国产三级| 久久久精品国产Sm最大网站| 久久精品中文字幕大胸| 无码精品久久久久久人妻中字| AV无码久久久久不卡蜜桃| 亚洲国产成人久久综合一| 久久久久这里只有精品| 亚洲精品乱码久久久久久蜜桃图片| 久久无码专区国产精品发布| 亚洲AV日韩AV天堂久久| 国产福利电影一区二区三区久久久久成人精品综合 | 欧美伊香蕉久久综合类网站| 久久综合九色综合久99| 久久高清一级毛片| 性做久久久久久久| 久久久网中文字幕| 久久久久久亚洲AV无码专区| 久久艹国产| 91精品国产综合久久婷婷 | 久久久久99精品成人片牛牛影视| 久久久这里有精品| 国产福利电影一区二区三区久久老子无码午夜伦不 | 中文字幕一区二区三区久久网站| 伊人色综合九久久天天蜜桃|