顺序表和链表的实现

#include<iostream>
using namespace std;
const int Maxsize=100;
class SeqList
{
public:
int length;
int a[100];
seqList(int );
int Get(int );
void Insert(int );
int Delete(int );

}; 
SeqList::seqList(int n)
{
int i,x;
cout<<"输入线性表长度"<<endl;
cin>>n;
for (i=0; i<n; i++)
{
cout<<"输入元素";
cin>>x;
cout<<"输入元素是："<<x<<endl;
a[i]=x;
} length=n;
cout<<"你输入的线性表是："<<endl;
for(i=0; i<length;i++)
cout<<a[i];
cout<<endl;