if curLen I= ob curLen)return 0; ListNode <char> "p=chList, g=ob.chlist; for( int i=0; i< curle if(p→dal=q→daua) reture0; else{p=p→link;q=q→lk; return I char& string l operator [(int i)i ∥取串中字符 while (pl= NULL &&k<i)ip=p-link; k++;3 if(pl= NULl)return p-data; return V0: string l& stringl∷ operator)( int pos, int len){取子串 if( pos >=0&& len >=0 & pos curLen & pos len -1 <curLen )i ListNode<char>*4, "p=chList; for(intk=0;k<pos;k++;)p=p→lmnk;∥定位于第pos结点 q=temp. chList =new ListNode<char> (p-data ) len;汁+){ ∥取长度为len的子串 g-g q-link new ListNode<char>(10); ∥建立串结束符 chlist new ListNodeschar (10);3 stringl& string l: operator+=( stringl&ab){∥串连接 ∥传送字符数 for(intk=0;k< curLen-1;k++;)p=p→lnk; Hthis串的串尾 for(k=0; k<len; k++)i ∥连接 new lisif ( curLen != ob.curLen ) return 0; ListNode <char> *p = chList, *q = ob.chList; for ( int i = 0; i < curLen; i++ ) if ( p→data != q→data ) return 0; else { p = p→link; q = q→link; } return 1; } char& string1 :: operator [ ] ( int i ) { //取串中字符 if ( i >= 0 && i < curLen ) { ListNode <char> *p = chList; int k = 0; while ( p != NULL && k < i ) { p = p→link; k++; } if ( p != NULL ) return p→data; } return '\0'; } string1& string1 :: operator ( ) ( int pos, int len ) { //取子串 string1 temp; if ( pos >= 0 && len >= 0 && pos < curLen && pos + len - 1 < curLen ) { ListNode<char> *q, *p = chList; for ( int k = 0; k < pos; k++; ) p = p→link; //定位于第 pos 结点 q = temp.chList = new ListNode<char> ( p→data ); for ( int i = 1; i < len; i++ ) { //取长度为 len 的子串 p = p→link; q = q→link = new ListNode<char> ( p→data ); } q→link = new ListNode<char> ( '\0' ); //建立串结束符 temp.curLen = len; } else { temp.curLen = 0; temp.chList = new ListNode<char> ( '\0' ); } return *temp; } string1& string1 :: operator += ( string1& ob ) { //串连接 if ( curLen + ob.curLen > maxLen ) len = maxLen - curLen; else len = ob.curLen; //传送字符数 ListNode<char> *q = ob.chList, *p = chList; for ( int k = 0; k < curLen - 1; k++; ) p = p→link; //this 串的串尾 k = 0; for ( k = 0; k < len; k++ ) { //连接 p = p→link = new ListNode<char> ( q→data ); q = q→link; }