数据结构与算法分析lecture3(链表)课件.ppt

Linked list implementation;;Singly linked list implementation;23;Linked list implementation;Void init() { fence=tail=head=new LinkElem; leftcnt=rightcnt=0; } Void removeall() //return link nodes to free store { while(head!=NULL) { fence=head; head=head-next; delete fence; } };Public: Llist(int size=DefaultListSize) { init(); } ~Llist() { removeall(); } //destructor void clear() { removeall(); init() } bool insert(const Elem); bool append(const Elem); bool remove(Elem); void setStart() { fence = head; rightcnt+ = leftcnt; leftcnt = 0; };void setEnd() { fence = tail; leftcnt+ = rightcnt; rightcnt = 0; } Void prev(); Void next() { if(fence != tail) //Don’t move fence if right empty { fence = fence-next;rightcnt--;leftcnt++;} };int leftLength() const {return leftcnt;} Int rightLength() const {return rightcnt;} bool setpos(int pos); bool getvalue(Elem it) const { if(rightLength() == 0) return false; it = fence-next-element; return true; } void print() const; };;Fence-next = new LinkElem(item,fence-next);;未定义的链表类成员函数的实现;templateclass Elem //append Elem to end of the list bool LListElem::append(const Elem item) { tail=tail-next=new LinkElem(item,NULL); rightcnt++; return true; };//remove and return first Elem in right partition templateclass Elem bool LlistElem:: remove(Elem it) { if(fence-next == NULL) return false;//empty right it=fence-next-element;//remember value LinkElem* ltemp=fence-next;//remember link node fence-next=ltemp-next;//remove from list if(tail=ltemp) tail=fence;//reset tail delete ltemp;//reclaim space rightcnt--; return true; };//move fence one step left;no change if left is empty templateclass Elem void LlistElem::prev() { LinkElem* temp=head; if(fence==head) return;//no previous Elem while(temp-next!=fence) temp=temp-next; fence=temp; leftcnt--; rightcnt++; };//