線形表 LinearList

底層使用一維數組作爲連續的存儲空間，此練習仿照STL的vector，自動擴展和收縮空間。擴展的算法是表中元素個數等於maxSize，則擴展爲2倍；收縮空間算法是當表中元素個數小於maxSize的四分之一，則將其空間收縮爲maxSize的一半。。。

 

另外 template 要求聲明和實現都放於一個h文件裏。下面是線性表的實現以及測試代碼：

 

LinearList.h

#pragma once #include <stdio.h> template<class T> class CLinearList { public: CLinearList(void); virtual ~CLinearList(void); bool IsEmpty() const; int Length() const; // 增刪改查 void Insert(int k, const T &x); bool Delete(int k, T &x); int Search(const T &x) const; bool Find(int k, const T &x) const; void Output(ostream &out) const; private: int length; int maxSize; T *element; }; template<class T> CLinearList<T>::CLinearList(void) { maxSize = 1; element = new T[maxSize]; length = 0; } template<class T> CLinearList<T>::~CLinearList(void) { delete []element; } template<class T> bool CLinearList<T>::IsEmpty() const { return (0 == length ); } template<class T> int CLinearList<T>::Length() const { return length; } // 增刪改查 template<class T> void CLinearList<T>::Insert(int k, const T &x) { // 數據空間不夠,擴展空間 if(length >= maxSize) { maxSize *= 2; T *newEle = new T[maxSize]; // memcpy(newEle, element, length); for(int i = 0; i < length; i++) { newEle[i] = element[i]; } delete []element; element = newEle; } // 移動數據 for(int i = length; i > k; i--) { element[i] = element[i-1]; } // 插入數據 element[k] = x; length++; } template<class T> bool CLinearList<T>::Delete(int k, T &x) { if(k < 0 || k > length) return false; x = element[k]; for(int i = k; i < length; i++) { element[i] = element[i+1]; } length--; // 收縮空間 if(length <= (maxSize/4) ) { maxSize /= 2; T *newEle = new T[maxSize]; for(int i = 0; i < length; i++) { newEle[i] = element[i]; } delete []element; element = newEle; } return true; } template<class T> int CLinearList<T>::Search(const T &x) const { for(int i = 0; i < length; i++) { if(element[i] == x) return i; } return -1; } template<class T> bool CLinearList<T>::Find(int k, const T &x) const { if(k < 0 || k > length) return false; x = element[k]; return true; } template<class T> void CLinearList<T>::Output(ostream &out) const { out << "length:" << length << endl; for(int i = 0; i < length; i++) { out << element[i] << endl; } }  

 

testDataStruct.cpp

// testDataStruct.cpp : 定義控制檯應用程序的入口點。 // #include "stdafx.h" #include <iostream> using namespace std; #include "LinearList.h" CLinearList<int> intLL; int _tmain(int argc, _TCHAR* argv[]) { cout << intLL.Length() << endl; intLL.Insert(0, 1); intLL.Output(cout); intLL.Insert(1, 3); intLL.Output(cout); intLL.Insert(2, 4); intLL.Output(cout); int n; intLL.Delete(1, n); cout << n << "deleted" << endl; intLL.Output(cout); int tmp = 0; cin >> tmp; return 0; }