线性表顺序存储结构的实现和运用

摘要：本文主要是线性表顺序存储结构的具体实现和运用，具体实现了线性表类，并且做了相应的测试。

Sqlist.h

#ifndef _SQLIST_
#define _SQLIST_

template<class ElemType>
class Sqlist {
public:
    Sqlist(int size);   //构造函数
    virtual ~Sqlist();   //析构函数
    int Lence();   //返回线性表的长度
    void Mypush_back(ElemType elem);  //向线性表中添加元素
    void Myshow();  //线性表的遍历
    bool Empty();  //判断线性表是否为空
    void Clear();  //清空线性表
    bool Getelem(int position,ElemType &e);  //检查线性表某个位置是否存在值，如果存在，就将该值传递给e值
    bool Setelem(int position,ElemType &e);  //将线性表的某个位置的元素设置为e值
    bool Insert(int position,ElemType &e);  //在线性表的某个位置插入一个元素
    bool Delete(int position, ElemType &e);  //删除线性表某一个位置的元素
    Sqlist(const Sqlist<ElemType> &copy);   //拷贝构造函数
    Sqlist<ElemType>&operator=(const Sqlist<ElemType> &copy);

protected:
    int count;   //实际元素个数
    int maxSize;  //最大元素个数
    ElemType *elems;   //线性表的名称
};

#endif

Sqlist.cpp

#include "Sqlist.h"
#include<iostream>

using namespace std;

template<class ElemType>
Sqlist<ElemType>::Sqlist(int size) {
    count = 0;
    maxSize = size;
    elems = new ElemType[maxSize];
}

template<class ElemType>
Sqlist<ElemType>::~Sqlist() {
    delete[] elems;
}

template<class ElemType>
int Sqlist<ElemType>::Lence() {
    return count;
}

template<class ElemType>
void Sqlist<ElemType>::Mypush_back(ElemType elem) {
    if(count<maxSize){ 
    elems[count] = elem;
    count++;
    }
}

template<class ElemType>
void Sqlist<ElemType>::Myshow() {
    if (count > 0) {
    for (int i=0;i<Lence();i++)
    {
        cout << elems[i] << endl;
    }
    }
    else {
        cout << "线性表中没有元素" << endl;
    }    
}

template<class ElemType>
bool Sqlist<ElemType>::Empty() {
    return count == 0;
}

template<class ElemType>
void Sqlist<ElemType>::Clear() {
    count = 0;
}

template<class ElemType>
bool Sqlist<ElemType>::Getelem(int position, ElemType &e) {
    if (position<1 || position>Lence()) {
        return false;
    }
    else {
        e = elems[position-1];
        return true;
    }
}

template<class ElemType>
bool Sqlist<ElemType>::Setelem(int position, ElemType &e) {
    if (position<1 || position>Lence()) {
        return false;
    }
    else {
        elems[position - 1]=e;
        return true;
    }
}

template<class ElemType>
bool Sqlist<ElemType>::Insert(int position, ElemType &e) {
    ElemType tmp;
    if (count == maxSize) {
        return false;
    }
    else if (position<1 || position>Lence()+1) {
        return false;
    }
    else {
        count++;
        for (int pos = Lence(); pos >= position;pos--) {
            Getelem(pos,tmp);
            Setelem(pos+1,tmp);
        }
        Setelem(position,e);
        return true;
    }
}

template<class ElemType>
bool Sqlist<ElemType>::Delete(int position,ElemType &e) {
    ElemType tmp;
    if (position<1 || position>Lence()+1) {
        return false;
    }
    else {
        Getelem(position,e);
        for (int pos = position + 1; pos < Lence() + 1;pos++) {
            Getelem(pos,tmp);
            Setelem(pos-1,tmp);
        }
    }
}

template<class ElemType>
Sqlist<ElemType>::Sqlist(const Sqlist<ElemType> &copy) {
    maxSize = copy.maxSize;
    elems = new ElemType[maxSize];
    count = copy.count;
    for (int pos = 1; pos <= Lence();pos++) {
        elems[pos-1] = copy.elems[pos-1];
    }
}

template<class ElemType>
Sqlist<ElemType>& Sqlist<ElemType>::operator=(const Sqlist<ElemType> &copy) {
    //此处判断是为了防止新的对象和被复制对象处于同一个内存空间
    if (&copy!=this) {
        maxSize = copy.maxSize;
        count = copy.count;
        if (elems!=NULL) {  //释放存储空间
            delete[] elems;
        }
        elems = new ElemType[maxSize];
    }
    for (int pos = 1; pos <= Lence(); pos++) {
        elems[pos - 1] = copy.elems[pos - 1];
    }
    return *this;
}

main.cpp

#include<iostream>
#include "Sqlist.cpp"
#include<string>


using namespace std;

void test() {
    Sqlist<string> sqlist(5);
    sqlist.Mypush_back("abc");
    sqlist.Mypush_back("qyw");
    sqlist.Mypush_back("shda123");
    sqlist.Mypush_back("gdsha");
    sqlist.Mypush_back("ashaj");
    //string a = "bughf";
    //sqlist.Insert(2, a);
    //sqlist.Clear();
    //cout << sqlist.Lence() << endl;
    sqlist.Myshow();
    //string c;
    //sqlist.Delete(2,c);
    //sqlist.Myshow();
    //cout << sqlist.Empty() << endl;
    //cout << a << endl;
    cout << "----------------------------------" << endl;
    Sqlist<string> list(sqlist);
    list.Myshow();
    Sqlist<string> s(5);
    s = sqlist;
    cout << "----------------------------------" << endl;
    s.Myshow();
}

int main() {
    test();

    system("pause");
    return 0;
}