2.1 线性表+2.2 顺序表

 C++代码实现顺序表

#include <iostream>
#include <cassert>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef int T;
const int defaultSize = 100;

class SeqList
{
private:
    T* data;//指向动态内存分配数组的指针
    int maxSize;//动态内存分配数组的大小
    //data数组里的个数，从1开始
    int last;//标识顺序表中最后一个元素的位置
    //位置，从零开始
    void Resize(int newSize);
public:
    SeqList(int sz=defaultSize);//构造函数
    SeqList(const SeqList& L);//拷贝构造函数
    SeqList& operator=(const SeqList& L);//赋值运算符函数
    ~SeqList();//析构函数

    int Size() const;//返回顺序表的容量
    int Length() const;//返回顺序表中元素的个数
    int Search(T & x) const;//在顺序表中搜索x
    int Locate(int i) const;//检验顺序表中是否存在第i个元素
    bool GetData(int i, T& x) const;//获取顺序表中第i个位置的元素
    void SetData(int i, T& x);//将顺序表中第i个位置的元素赋值为x
    bool IsEmpty() const;//顺序表是否为空
    bool IsFull() const;//顺序表是否为满
    bool Insert(int i, const T& x) ;//在顺序表的第i个元素的位置插入x
    bool Remove(int i, T&x) ;//删除顺序表第i个位置的元素

    void Sort();//对顺序表中元素进行排序
    friend istream& operator>>(istream& in, SeqList & L);//输入运算符重载
    friend ostream& operator<<(ostream& out, const SeqList& L);//输出运算符重载
    void Reverse();//逆置顺序表中的元素
};

SeqList::SeqList(int sz)
{
    if(sz > 0)
    {
        maxSize = sz;
        last = -1;
        data = new T[maxSize];
        if(data == NULL)
        {
            cout << "data is wrong!" << endl;
            exit(1);
        }
    }
    else
        cout << "number is wrong!" << endl;
}

SeqList::SeqList(const SeqList& L)
{
    maxSize = L.maxSize;
    last = L.last;
    data = new T[maxSize];
    if(data == NULL)
    {
        cout << "memery is wrong!" << endl;
        exit(1);
    }
    for(int i=0; i<=last; i++)
    {
        data[i]=L.data[i];
    }
}

SeqList& SeqList::operator=(const SeqList&L)
{
    if(this==&L)
        return *this;
    delete []data;

    maxSize = L.maxSize;
    last = L.last;
    data = new T[maxSize];
    if(data == NULL)
    {
        cout << "memery is wrong!" << endl;
        exit(1);
    }
    for(int i=0; i<last; ++i)
        data[i] = L.data[i];
    return *this;
}

SeqList::~SeqList()
{
    delete[]data;
}

int SeqList::Size() const
{
    return maxSize;
}

int SeqList::Length() const
{
    return last+1;
}

void SeqList::Resize(int newsize)
{
    if(newsize <= 0)  //检查是否合法
        return;
    if(newsize != maxSize)
    {
        T* newAry = new T[newsize];
        if(newAry == NULL)
            exit(1);
        int n = last+1;
        T* srcptr = data;
        T* destptr = newAry;
        while(n--)
            *destptr++ = *srcptr++;  //指针赋值
        delete[]data;
        data = newAry;
        maxSize = newsize;
    }
}

int SeqList::Search(T& x)const
{
    for(int i=0; i<=last; i++)
        if(data[i]==x)
            return i+1;
    return 0;
}

int SeqList::Locate(int i)const
{
    if(i>=1 && i<=last+1)
        return i;
    else
        return 0;
}

bool SeqList::GetData(int i, T& x) const
{
    if(Locate(i))
    {
        x=data[i-1];
        return true;
    }
    else
        return false;
}

void SeqList::SetData(int i, T& x)
{
    if(Locate(i))
        data[i-1]=x;
}

bool SeqList::IsEmpty()const
{
    if(last == -1)
        return true;
    else
        return false;
}

bool SeqList::IsFull()const
{
    if(last == maxSize-1)
        return true;
    else
        return false;
}

bool SeqList::Insert(int i, const T& x)
{
    if(last == maxSize-1) //如果满了，扩大空间
    {
        Resize(defaultSize);
    }
    if(i<0||i>last+1)  //不在长度之内，给出提示，不插入
        return false;
    for(int j=last; j>=i-1; j--)
        data[j+1]=data[j];
    data[i-1] = x;
    last++;
    return true;
}

bool SeqList::Remove(int i,T& x)
{
    if(last == -1)   //空表，给出提示
    {
        cout << "empty" << endl;
        return false;
    }
    if(!Locate(i))
        return false;
    x=data[i-1];
    for(int j=i-1; j<last; j++)
        data[j]=data[j+1];
    last--;
    return true;
}

void SeqList::Sort()
{
    for(int i=0; i<=last; i++)
        for(int j=i; j<last; j++)
        {
           // cout << data[i] << ' ' << data[j] << endl;
            if(data[i]>data[j])
                swap(data[i],data[j]);
        }

}

void SeqList::Reverse()
{
    for(int i=0,j=last-1; i<j; i++,j--)
    {
        //cout << data[i] << ' ' << data[j] << endl;
        swap(data[i],data[j]);
    }
}

istream& operator>>(istream& in, SeqList & L)
{
    while(1)
    {
        cout << "The number of the list: ";
        cin>>L.last;
        if(L.last<=L.maxSize-1)
            break;
        else
        {
            cout << "please try again." << endl;;
        }
    }
    for(int i=0; i< L.last; i++)
    {
        cin >> L.data[i];

    }
    return in;
}

ostream& operator<<(ostream& out, const SeqList& L)
{
    cout << "The number of the list: ";
    for(int i=0; i< L.last; i++)
        cout << L.data[i] <<' ';
    cout << endl;
    return out;
}

int main()
{
    SeqList sList;

    cin >> sList;
    cout<<sList;

    cout << "insert: ";
    int i, val;
    cin>>i>>val;
    sList.Insert(i,val);
    cout<<sList;

    cout << "remove: ";
    cin>>i;
    sList.Remove(i,val);
    cout<<sList;

    cout << "search: ";
    cin>>val;
    i=sList.Search(val);
    if(i==0)
        cout<<"Not found"<<endl;
    else
        cout<<i<<endl;

    cout << "reverse: " << endl;
    sList.Reverse();
    cout<<sList;

    cout << "sort: " << endl;
    sList.Sort();
    cout<<sList;

    SeqList L2;
    L2=sList;
    cout << "L2 is :" << L2;
}

测试结果