线性表物理实现(顺序表和链表).ppt

第4章 线性表、栈和队列 线性表的实现 线性表的实现有两种标准方法 顺序表（array-based list） 链表（linked list） 顺序表的实现方法 链表的实现方法 比较两种方式的时间、空间效率 线性表的顺序表实现的原则 线性表ADT？ 顺序表的特点？ 用顺序表来实现线性表的物理数据结构，要实现一些什么？ Array-Based List Class (1) template class Elem // Array-based list class AList : public ListElem { private: int maxSize; // Maximum size of list int listSize; // Actual elem count int fence; // Position of fence Elem* listArray; // Array holding list public: AList(int size=DefaultListSize) { maxSize = size; listSize = fence = 0; listArray = new Elem[maxSize]; } Array-Based List Class (2) ~AList() { delete [] listArray; } void clear() { delete [] listArray; listSize = fence = 0; listArray = new Elem[maxSize]; } void setStart() { fence = 0; } void setEnd() { fence = listSize; } void prev() { if (fence != 0) fence--; } void next() { if (fence = listSize) fence++; } int leftLength() const { return fence; } int rightLength() const { return listSize - fence; } Array-Based List Class (3) bool setPos(int pos) { if ((pos = 0) (pos = listSize)) fence = pos; return (pos = 0) (pos = listSize); } bool getValue(Elem it) const { if (rightLength() == 0) return false; else { it = listArray[fence]; return true; } } Append // Append Elem to end of the list template class Elem bool AListElem::append(const Elem item) { if (listSize == maxSize) return false; listArray[listSize++] = item; return true; } Array-Based List Insert Insert // Insert at front of right partition template class Elem bool AListElem::insert(const Elem item) { if (listSize == maxSize) return false; for(int i=listSize; ifence; i--) // Shift Elems up to make room listArray[i] = listArray[i-1]; listArray[fence] = item; listSize++; // Increment list size return true; } Remove // Remove and return first Elem in right // partition template class Elem bool AListElem::remove(Elem it) { if (rightLength() == 0) return false; it = listArray[fence]; // Co