数据结构算法与应用-C++语言描述笔记（线性表）

#ifndef __LINEAR_LIST_H__
#define __LINEAR_LIST_H__

#include <iostream>
using namespace std;

template <class T>
class LinearList
{
public:
    LinearList(int MaxListSize = 10);
    ~LinearList()
    {
        delete []element;
    }
    bool IsEmpty() const
    {
        return length==0;
    }
    bool Find(int k, T& x) const;
    int Search(const T& x) const;

    LinearList<T>& Delete(int k, T& x);
    LinearList<T>& Insert(int k, const T& x);
    void Output(ostream& out) const;
private:
    int length;
    int MaxSize;
    T*    element;
};

template <class T>
LinearList<T>::LinearList(int MaxListSize)
{
    MaxSize = MaxListSize;
    element = new T[MaxSize];
    length = 0;
}

template <class T>
bool LinearList<T>::Find(int k, T& x) const
{
    if (k<1 && k>length)
        return false;
    x = element[k-1];
    return true;
}

template <class T>
int LinearList<T>::Search(const T& x) const
{
    for(int i=0; i<length; i++)
    {
        if (element[i] == x)
            return ++i;
        return 0;
    }
}

template <class T>
LinearList<T>& LinearList<T>::Delete(int k, T& x)
{
    if (Find(k,x))
    {
        for(int i=k; i<length; i++)
            element[i-1] = element[i];
        length--;
        return *this;
    }
    else
        throw;
}

template <class T>
LinearList<T>& LinearList<T>::Insert(int k, const T& x)
{
    if (k<0 || k>length)
        throw;
    if (length == MaxSize)
        throw;
    for(int i=length-k; i>=k; i--)
        element[i+1] = element[i];
    element[k] = x;
    length ++;
    return *this;
}

#endif