数据结构 顺序表c++简单实现

#include <bits/stdc++.h>
using namespace std;
const int maxSize = 100;
template <class T>
class seqList
{
private:
    int length;
    T data[maxSize];

public:
    seqList() { length = 0; }        //无参构造函数
    seqList(T a[], int n);           //有参构造函数
    ~seqList(){};                    //析构函数
    int Length() { return length; }; //获取长度
    T get(int i);                    //根据下标获取元素
    int locate(T i);                 //根据元素值定位下标
    void insert(int i, T x);         //插入
    T Delete(int i);                 //删除
    void printList();                //遍历打印
};
template <class T>
seqList<T>::seqList(T a[], int n)
{
    if (n <= maxSize)
    {
        for (int i = 0; i < n; i++)
        {
            data[i] = a[i];
        }
        length = n;
    }
    else
    {
        cout << "error" << endl;
    }
}

template <class T>
T seqList<T>::get(int i)
{
    return data[i];
}
template <class T>
int seqList<T>::locate(T i)
{
    for (int j = 0; j < length; j++)
    {
        if (data[j] == i)
        {
            return j;
        }
    }
    cout << "not found" << endl;
    return -1;
}
template <class T>
void seqList<T>::insert(int i, T x)
{
    if (length >= maxSize)
    {
        cout << "error" << endl;
        return;
    }
    for (int j = length - 1; j >= i; j--) //从后往前，往后移一位；第一次想到的空间开销大..太菜了
    {
        data[j + 1] = data[j];
    }
    length++;
    data[i] = x;
    // int temp[length - i];
    // int t = i;
    // for (int j = 0; j < length - i; j++)
    // {
    //     temp[j] = data[t];
    //     t++;
    // }
    // data[i] = x;
    // for (int j = 0; j < length + 1; j++)
    // {
    //     data[i + 1] = temp[j];
    //     i++;
    // }
    // length++;
}
template <class T>
T seqList<T>::Delete(int i)
{
    T temp = data[i];
    for (int j = i; j < length - 1; j++)
    {
        data[j] = data[j + 1];
    }
    length--;
    return temp;
}
template <class T>
void seqList<T>::printList()
{
    for (int i = 0; i < length; i++)
    {
        cout << data[i] << endl;
    }
}
int main()
{
    int n = 10;
    int a[n];
    for (int i = 0; i < n; i++)
    {
        a[i] = i + 1;
    }
    seqList<int> student(a, n);
    student.printList();
    cout << "-------------------" << endl;
    student.insert(0, 1);
    student.printList();
    cout << "-------------------" << endl;
    student.Delete(5);
    student.printList();
    system("pause");
    return 0;
}