WarTalker — Sat, 30 Jun 2007 08:52:00 GMT

题目要求基本如下�Q?span lang="EN-US">
��L��写一个控制台�E�序,要求用户可以输入��L��l�条�Ӟ��定义两个字母之间的大��关�p�R��程序可以通过已输入的条�g�Q�推断出�l�定的两个字母之间的大小关系。例如：
用户输入�Q?span lang="EN-US">A>B
用户输入�Q?span lang="EN-US">B>C
用户输入�Q?span lang="EN-US">A?C
�E�序昄��Q?span lang="EN-US">A>C
用户输入�Q?span lang="EN-US">C 用户输入�Q?span lang="EN-US">A?D
�E�序昄��Q�无法判�?span lang="EN-US">
用户输入�Q?span lang="EN-US">A �E�序昄��Q�与原有条�g冲突

#include
#include

using namespace std;
/*
*数组依次存放A-Z,�q�保存大于和��于该字母的字母链表
*/
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 <                      break;
                 }
                 if( FindDown(first,second) )
                 {
                        cout<'<                        break;
                 }
                 cout << "Unknown" << endl;
                 break;

                 case 'Q':
                 goto End;
           }
    }

End:
    Free( );

    system("PAUSE");
    return EXIT_SUCCESS;
}

WarTalker 2007-06-30 16:52 发表评论

麻豆精品久久久久久久99蜜桃 ,99久久国产亚洲综合精品,97r久久精品国产99国产精