数据结构课程设计 广义表的运算 程序.docVIP

数据结构课程设计 广义表的运算 程序 #includeiostream.h #includestring.h #includecstdlib class GenListNode{ friend class GenList; public: int utype; //0,1,2,3 union{ int intinfo; char charinfo; GenListNode* hlink; }value; GenListNode* tlink; GenListNode(){} }; class GenList{ public: GenListNode * first; int Sever( char* hstr,char * s ); void strncpy1( char* hstr,char* s,int comma ); GenListNode* CreatList( char* s ); void Creat( char* s ); void Display( void ); void Display( char * s ,GenListNode* ls); void show( GenListNode* ls ); void head(GenListNode* u); void tail(GenListNode* u); int display(GenListNode* u1,GenListNode* u); void find(char* s,GenListNode* u); }; void GenList::Creat( char* s ) { first=CreatList(s); } GenListNode* GenList::CreatList( char* s ) { GenListNode *ls,*head; ls=new GenListNode(); head=ls; ls-utype=0; if( strlen(s)=2 ) { ls-tlink=NULL; }else{ char* sub; while( strlen(s)2 ){ ls = ls-tlink = new GenListNode(); ls-utype=Sever(sub,s); switch( ls-utype ){ case 1:ls-value.intinfo=atoi(sub);break; case 2:ls-value.charinfo=sub[0];break; case 3:ls-value.hlink=CreatList( sub );break; } } ls-tlink=NULL; } return head; } int GenList::Sever( char* hstr,char* s ) { char ch=s[0]; int n=strlen( s ); int i=0,k=0,comma=-1; int x=0,y=0; while( in (ch!=, || k!=0) ){ if( ch==( ){ k++;} else{ if( ch==) ){ k--;} } i++; ch=s[i]; if(ch==, x==0){x=10;comma=i;} if(k==1 x8){x++;if(x==2){comma=i;}} } if( k!=0 ){ cout括号不配对! 退出程序!endl; exit(1); } if( comma==-1 ) {comma=n;} strncpy1( hstr,s,comma ); //分割字符串 if( strlen(hstr)=3 ){return 3;} else{ if( hstr[0]=9 hstr[0]=0 ){return 1;} if( hstr[0]=z hstr[0]=a ){return 2;} } return 1; } void GenList::strncpy1 (char* hstr,char* s,int comma ){ int n=strlen(s); hstr=new char[n]; for( int t=0,i=1;icomma;i++ ){ hstr[t]=s[i]; t++; } hstr[t]=\0; for( t=1,i=comma+1;in;t+