#include<iostream>
using namespace std;
struct node
{
int data;
node*next;
};
class linklist
{
public:
linklist();
linklist(int a[],int n);
~linklist();
int length();
int get(int i);
int locate(int x);
void insert(int i,int x);
int delet(int i);
void printlist();
private:
node*first;
};
void linklist::printlist()
{
node * p;
p=first->next;
while(p!=NULL)
{
cout<<p->data;
p=p->next;
}
}
int linklist::length()
{
node *p;
p=first->next;
int count=0;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}
int linklist::get(int i)
{
node *p;
p=first->next;
int count=1;
while(p!=NULL && count<1)
{
p=p->next;
count++;
}
if(p==NULL) cout<<"位置"<<endl;
else return p->data;
}
int linklist::locate(int x)
{
