线性表

// LinearList.h#ifndef _LINEARLIST_H_ #define _LINEARLIST_H_ #include <iostream> using namespace std; template <class T> class LinearList { public: virtual bool IsEmpty() const=0; virtual int Length() const=0; virtual bool Find(int i, T& x) const=0; virtual int Search(T x) const=0; virtual bool Insert(int i, T x)=0; virtual bool Delete(int i)=0; virtual bool Update(int i, T x)=0; virtual void Output(ostream& out) const=0; protected: int n; }; #endif

 

// SeqList.h#ifndef _SEQLIST_H_ #define _SEQLIST_H_ #include "LinearList.h" template <class T> class SeqList:public LinearList<T> { public: SeqList(int mSize); ~SeqList(); bool IsEmpty() const; int Length() const; bool Find(int i, T& x) const; int Search(T x) const; bool Insert(int i, T x); bool Delete(int i); bool Update(int i, T x); void Output(ostream& out) const; private: int maxLength; T* elements; }; #endif

 

//SeqList.cpp#include "SeqList.h" //export template <class T> class SeqList; template <class T> SeqList<T>::SeqList(int mSize) { maxLength = mSize; elements = new T[maxLength]; n = 0; } template <class T> SeqList<T>::~SeqList() { delete [] elements; } template <class T> bool SeqList<T>::IsEmpty() const { return n==0; } template <class T> int SeqList<T>::Length() const { return n; } template <class T> bool SeqList<T>::Find(int i, T& x) const { if(i<0 || i>n-1) { cout << "out of Bounds" << endl; return false; } x = elements[i]; return true; } template <class T> int SeqList<T>::Search(T x) const { for(int i=0; i<n; ++i) { if(elements[i]==x) return i; } return -1; } template <class T> bool SeqList<T>::Insert(int i, T x) { if(i<-1 || i>n-1) { cout << "out of Bounds" << endl; return false; } if(n == maxLength) { cout << "OverFlow" << endl; return false; } for(int j=n-1; j>i; --j) elements[j+1] = elements[j]; elements[i+1] = x; n++; return true; } template <class T> bool SeqList<T>::Delete(int i) { if(!n) { cout << "UnderFlow" << endl; return false; } if(i<0 || i>n-1) { cout << "out of Bounds" << endl; return false; } for(int j=i; j<n; ++j) elements[j] = elements[j+1]; n--; return true; } template <class T> bool SeqList<T>::Update(int i, T x) { if(i<0 || i>n-1) { cout << "out of Bounds" << endl; return false; } elements[i] = x; return true; } template <class T> void SeqList<T>::Output(ostream& out) const { for(int i=0; i<n; ++i) out << elements[i] << " "; out << endl; } 

 

注意： 对i进行的越界检查，以及插入和删除时上溢和下溢的检查

 

顺序表的优点是可以随机存取，但如果插入和删除操作过于频繁，效率则大大降低。此处，必须按事先估计的最大元素个数分配连续的存储空间，估计大了浪费存储空间，估计小了容易产生溢出。采用链接方式可以克服上述不足。