[工学]数据结构 C++源代码.doc

1、顺序表 Seqlist.h const int DefaultSize=100; template typename Type class SeqList{ public: SeqList(int sz=DefaultSize) :m_nmaxsize(sz),m_ncurrentsize(-1){ if(sz0){ m_elements=new Type[m_nmaxsize]; } } ~SeqList(){ delete[] m_elements; } int Length() const{ //get the length return m_ncurrentsize+1; } int Find(Type x) const; //find the position of x int IsElement(Type x) const; //is it in the list int Insert(Type x,int i); //insert data int Remove(Type x); //delete data int IsEmpty(){ return m_ncurrentsize==-1; } int IsFull(){ return m_ncurrentsize==m_nmaxsize-1; } Type Get(int i){ //get the ith data return i0||im_ncurrentsize?(coutcant find the elementendl,0):m_elements[i]; } void Print(); private: Type *m_elements; const int m_nmaxsize; int m_ncurrentsize; }; template typename Type int SeqListType::Find(Type x) const{ for(int i=0;im_ncurrentsize;i++) if(m_elements[i]==x) return i; coutcant find the element you want to findendl; return -1; } template typename Type int SeqListType::IsElement(Type x) const{ if(Find(x)==-1) return 0; return 1; } template typename Type int SeqListType::Insert(Type x, int i){ if(i0||im_ncurrentsize+1||m_ncurrentsize==m_nmaxsize-1){ coutthe operate is illegalendl; return 0; } m_ncurrentsize++; for(int j=m_ncurrentsize;ji;j--){ m_elements[j]=m_elements[j-1]; } m_elements[i]=x; return 1; } template typename Type int SeqListType::Remove(Type x){ int size=m_ncurrentsize; for(int i=0;im_ncurrentsize;){ if(m_elements[i]==x){ for(int j=i;jm_ncurrentsize;j++){ m_elements[j]=m_elements[j+1]; } m_ncurrentsize--; continue; } i++; } if(size==m_ncurrentsize){ coutcant find the element you want to removeendl; return 0; } return 1; } template typename Type void SeqListType::Print(){ for(int i=0;i=m_ncurrentsize;i++) couti+1:\tm_elements[i]endl; coutendlendl; } Test.cpp #include iostream #include SeqList.h using namespace std; int main() {