• <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 閱讀(146) 評論(0)  編輯 收藏 引用
            久久国产美女免费观看精品 | 国产精品日韩深夜福利久久| 久久久久免费精品国产| 久久精品不卡| 国内精品久久久久久野外| 久久影视国产亚洲| 久久国产高潮流白浆免费观看| 久久最近最新中文字幕大全 | 99久久精品国产免看国产一区| 久久精品国产福利国产秒| 欧美一区二区久久精品| 精品久久久久久久久中文字幕| 国产精品99久久久精品无码| 欧美日韩中文字幕久久伊人| 99蜜桃臀久久久欧美精品网站 | 久久亚洲国产欧洲精品一| 久久香综合精品久久伊人| 久久精品视频免费| 久久精品国产亚洲AV电影| 久久成人小视频| 久久国产成人| 亚洲午夜久久久精品影院| 精品久久久无码人妻中文字幕豆芽| 久久久久久久免费视频| 久久久久人妻精品一区三寸蜜桃 | yy6080久久| 亚洲国产成人久久笫一页| 国产精品久久久久乳精品爆| 久久精品国产只有精品2020| 99久久99久久久精品齐齐| 久久亚洲精品人成综合网| 久久精品国产99久久久古代| 久久人人爽人人爽人人片AV不 | 99久久免费国产精品特黄| 亚洲欧洲精品成人久久奇米网| 日本久久久久久久久久| 亚洲国产成人精品无码久久久久久综合 | 97久久精品人妻人人搡人人玩| 久久精品国产亚洲av麻豆小说| 久久无码人妻一区二区三区午夜| 久久人人爽人人爽人人片AV不|