C++实现动态顺序表
#include<iostream>
using namespace std;
#include<assert.h>
#define Datatype int
class Seqlist
{
friend ostream& operator<<(ostream &_cout, const Seqlist& s);
public:
Seqlist();
Seqlist(Datatype arr[], size_t size);
Seqlist(const Seqlist& s);
Seqlist& operator=(const Seqlist& s);
~Seqlist();
void PushBack(const Datatype& data);
void PopBack();
void Insert(size_t pos, const Datatype& data);
void Erase(size_t pos);
int Find(const Datatype &data)const;
size_t Size()const;
size_t Capacity()const;
Datatype& Front();
Datatype& Front()