数据结构2技术总结.pptVIP

作为抽象数据类型的数组 顺序表 (Sequential List) 多项式抽象数据类型 (Polynomial ADT) 稀疏矩阵 (Sparse Matrix) 字符串 (String) ;作为抽象数据类型的数组;一维数组的特点;数组的定义和初始化;main ( ) { szcl a1[3] = { 3, 5, 7 }, *elem; for ( int i=0, i3, i++ ) cout a1[i].get_value ( ) “\n”; //打印静态数组 elem = a1; for ( int i=0, i3, i++ ) { cout elem→get_value( ) “\n”; //打印动态数组 elem++; } return 0; } ;一维数组(Array)类的定义; ~Array( ) { delete [ ]elements;} ArrayType operator = ( const ArrayType A ); Type operato [ ] ( int i ); ArrayType operator Type * ( ) const { return elements; } int Length ( ) const { return ArraySize; } void ReSize ( int sz ); }; template class Type void ArrayType::getArray ( ) { //私有函数：创建数组存储空间 elements = new Type[ArraySize]; if ( elements == 0 ) cerr Memory Allocation Error endl; }; template class Type void ArrayType::Array ( int sz ) { //构造函数 if ( sz = 0 ) { cerr Invalid Array Size endl; return; } ArraySize = sz; getArray ( ); }; template class Type ArrayType:: Array ( const ArrayType x ) { //复制构造函数 int n = ArraySize = x.ArraySize; elements = new Type[n]; if ( elements == 0 ) cerr Memory Allocation Error endl; Type *srcptr = x.elements; Type *destptr = elements; while ( n-- ) * destptr++ = * srcptr++; };template class Type Type ArrayType::operator [ ] ( int i ) { //按数组名及下标i，取数组元素的值 if ( i 0 || i ArraySize-1 ) cerr Index out of Range endl; return element[i]; } 使用该函数于赋值语句 Position[i] = Position[i -1] + Number[i -1] ; template class Type void ArrayType::Resize (int sz) { if ( sz = 0 sz != ArraySize ) { Type * newarray = new Type[sz]; if ( newarray == 0 ) cerr Memory Allocation Error e