数据结构C++版顺序表

代码实现：

//线性表 
#include<iostream>
using namespace std;
const int defaultSize = 100;
class SeqList {
   
public:
	SeqList(int sz = defaultSize) {
   
		if (sz > 0) {
   
			maxSize = sz;
			last = -1;
			data = new int[maxSize];

		}
	}
	SeqList(SeqList& L) {
   
		maxSize = L.Size();
		last = L.Length() - 1;
		int value;
		data = new int[maxSize];
		if (data == NULL) {
   
			cerr << "存储分配错误" << endl;
			exit(1);
		}
		for (int i = 1; i <= last + 1; i++) {
   
			L.getData(i, value);
			data[i - 1] = value;
		}
	}
	~SeqList() {
    
			delete []data; 
	}
	int Size()const {
   
		return maxSize;
	}
	int