数据结构1-3答案.docVIP

1.3 //get the length of a string Int strlen(String s1); //compare two strings,1 for s1s2;,0 for s1==s2, and -1for s1s Int strcmp(String s1 ,String s2 ; //copy the string void strcpy(String s1 , String s2 ; //swap two strings void strswp(String s1 , String s2); //connect two strings String strcat(String s1 , String s2); // beg is the beginning index of the substring //and len is the length of the substring String substr(int beg , int len , String s1); 1.4 //List abstract class Templateclass Elem class List { Public: //Reinitialize the list .The client is responsible for //reclaiming the storage used by the list elements. Virtual void clear()=0; //Insert an element at the front of the right partition. //Return true if successful,false if the list is full. Virtual bool append(const Elem)=0; //Remove the first element of right partition.Return //true if successful,false if right partition is empty. //The element removed is returned in the parameter. Virtual bool remove(Elem)=0; //Place fence at list start,making left partition empty. Virtual void setStart()=0; //Place fence at list end,making right partition empty Virtual void setEnd()=0; //Move fence one step left;no change if already at start Virtual void prev()=0; //Move fence one step right;no change if already at end Virtual void next()=0; //Return length of left partition Virtual int rightLength() const=0; //Return length of right partition Virtual int rightLength() const=0; //If pos or more elements are in the list,set the size //of left partition to pos and return true.Otherwise, //do nothing and return false. Virtual bool setPos(int pos)=0; //Return in first parameter the first element of the //right partition .Return true if successful,false //if the right partition is empty. Virtual bool getValue (Elem) const =0; //Print the contents of the list. Virtual void print() const =0; }; 1.7 An algorithm is a method or a process followed to solve a problem. But not every problem have an algorithm. Bec