《数据结构教学课件》第二章 线性表.pptVIP

顺序表(SeqList)类的定义 template class Type class SeqList { Type *data; //顺序表存储数组 int MaxSize; //最大允许长度 int last; //当前最后元素下标 public: SeqList ( int MaxSize = defaultSize ); ~SeqList ( ) { delete [ ] data; } int Length ( ) const { return last+1; } int Find ( Type x ) const; //查找 int Locate ( int i ) const; //定位 int Insert ( Type x, int i ); //插入 int Remove ( Type x ); //删除 int Next ( Type x ) ; //后继 int Prior ( Type x ) ; //前驱 int IsEmpty ( ) { return last ==-1; } int IsFull ( ) { return last == MaxSize-1; } Type Get ( int i ) { //提取 return i 0 || i last？NULL : data[i]; } } 顺序表部分公共操作的实现 template class Type //构造函数 SeqListType :: SeqList ( int sz ) { if ( sz 0 ) { MaxSize = sz; last = -1; data = new Type[MaxSize]; if ( data == NULL ) { MaxSize = 0; last = -1; return; } } } template class Type int SeqListType :: Find ( Type x ) const { //搜索函数：在顺序表中从头查找结点值等于 //给定值x的结点 int i = 0; while ( i = last data[i] != x ) i++; if ( i last ) return -1; else return i; } template class Type int SeqListType :: Insert (Type x, int i ) { //在表中第 i 个位置插入新元素 x if ( i 0 || i last+1 || last == MaxSize-1 ) return 0; //插入不成功 else { last++; for ( int j = last; j i; j-- ) data[j] = data[j -1]; data[i] = x; return 1; //插入成功 } } template class Type int SeqListType :: Remove ( Type x ) { //在表中删除已有元素 x int i = Find (x); //在表中搜索 x if ( i = 0 ) { last-- ; for ( int j = i; j = last; j++ ) data[j] = data[j+1]; return 1; //成功删除 } return 0;