数据结构_顺序表

线性表的顺序存储是指在内存中用地址连续的一块存储空间顺序存放线性表的各元素，用这种存储形式存储的线性表称为顺序表。

顺序表实现的头文件SeqList.h：

#ifndef SEQLIST_H
#define SEQLIST_H

#include <iostream>

using namespace std;

template<class T>
class SeqList
{
public:
    SeqList(int size = 3);
    ~SeqList();
    int getSLSize();
    int getCurrentSize();
    bool isEmpty();
    T get(int index);
    bool slInsert(int index, T t);
    bool slDelete(int index);
private:
    T *pdata;
    int size;
    int last;
};

template<class T>
SeqList<T>::SeqList(int size)
{
    pdata = new T[size];
    this->size = size;
    last = -1;
}

template<class T>
SeqList<T>::~SeqList()
{
    delete [] pdata;
    pdata = NULL;
}

template<class T>
int SeqList<T>::getSLSize()
{
    return this->size;
}

template<class T>
int SeqList<T>::getCurrentSize()
{
    return this->last;
}

template<class T>
bool SeqList<T>::isEmpty()
{
    if(last == -1) return true;
    else return false;
}

template<class T>
T SeqList<T>::get(int index)
{
    if(index < 0 || index > last)
    {
        cout << "Get value failed! The index is out of bound!" << endl;
//        return ;
    }

    return pdata[index];
}

//Element t is at index(start from 0) after inserting
template<class T>
bool SeqList<T>::slInsert(int index, T t)
{
    if(last == size - 1)
    {
        cout << "Table is full!" << endl;
        return false;
    }

    if(index < 0 || index > last + 1)
    {
        cout << "Location error!" << endl;
        return false;
    }

    //If the table is empty
    if(last == -1)
    {
        pdata[0] = t;
        last++;
        return true;
    }

    //If the location is at last
    if(index == last + 1)
    {
        pdata[index] = t;
        last++;
        return true;
    }

    //For common situation
    for(int j = last; j >= index; j--)
    {
        pdata[j + 1] = pdata[j];
    }
    pdata[index] = t;
    last++;
    return true;
}

template<class T>
bool SeqList<T>::slDelete(int index)
{
    if(index < 0 || index > last)
    {
        cout << "Location error!" << endl;
        return false;
    }

    if(last == -1)
    {
        cout << "Table is empty!" << endl;
        return false;
    }

    //If the location is at last
    if(index == last)
    {
        last--;
        return true;
    }

    //For common situation
    for(int j = index; j < last; j++)
    {
        pdata[j] = pdata[j + 1];
    }
    last--;
    return true;
}

#endif

顺序表的测试文件TSeqList.cpp：

#include <iostream>
#include <SeqList.h>
#include <string>

using namespace std;

struct Student
{
    string name;
    int id;
};

class A
{
public:
    A()
    {
        f = 0;
    }
    void setv(int v = 1);
    int f;
};

//void A::setv(int v = 3) //Compile error
void A::setv(int v)
{
    this->f = v;
}

void ObjectTest()
{
    Student stu[] =
    {
        {"Sky", 11},
        {"Rose", 12},
        {"Jack", 13},
    };

    cout << endl << "----object test----" << endl;
    SeqList<Student> *pslist = new SeqList<Student>();
    cout << "size = " << pslist->getSLSize() << endl;

    cout << "Check location:" << endl;
    pslist->slInsert(-1, stu[0]);

    cout << "Insert when table is empty" << endl;
    pslist->slInsert(0, stu[0]);

    cout << "Insert at last" << endl;
    pslist->slInsert(1, stu[1]);

    cout << "Insert at first" << endl;
    pslist->slInsert(0, stu[2]);

    Student p;
    int cuSize = pslist->getCurrentSize();
    for(int i = 0; i <= cuSize; i++)
    {
        p = pslist->get(i);
        cout << "pslist[" << i << "] = " << p.name << ", " << p.id << endl;
    }

    cout << "Check overflow:" << endl;
    pslist->slInsert(0, stu[0]);

    cout << "Check deleting location:" << endl;
    pslist->slDelete(3);

    cout << "Delete the first one:" << endl;
    pslist->slDelete(0);
    cuSize = pslist->getCurrentSize();
    for(int i = 0; i <= cuSize; i++)
    {
        p = pslist->get(i);
        cout << "pslist[" << i << "] = " << p.name << ", " << p.id << endl;
    }

    cout << "Check deleting the last one" << endl;
    pslist->slDelete(1);
    cuSize = pslist->getCurrentSize();
    for(int i = 0; i <= cuSize; i++)
    {
        p = pslist->get(i);
        cout << "pslist[" << i << "] = " << p.name << ", " << p.id << endl;
    }

    int k = 0;
    while(!pslist->isEmpty())
    {
        pslist->slDelete(0);
        k++;
    }
    cout << "After deleting size = " << k << endl;

    A a;
    a.setv();
//    a.setv(6);
    cout << "f = " << a.f << endl;

    delete pslist;
    return;
}

int main()
{
    ObjectTest();
    return 0;
}

输出结果：

----object test----
size = 3
Check location:
Location error!
Insert when table is empty
Insert at last
Insert at first
pslist[0] = Jack, 13
pslist[1] = Sky, 11
pslist[2] = Rose, 12
Check overflow:
Table is full!
Check deleting location:
Location error!
Delete the first one:
pslist[0] = Sky, 11
pslist[1] = Rose, 12
Check deleting the last one
pslist[0] = Sky, 11
After deleting, size = 1
f = 1

顺序表插入操作注意事项：

1）判断表是否满，若满了不作插入；

2）检验插入位置的有效性；

3）若为空表，直接插入首位置；

4）若在表末端插入，无需移动元素。

顺序表删除操作注意事项：

1）判断表是否为空；

2）检验删除位置的有效性；

3）若删除最后一个元素，则无需移动其它元素。