#include<iostream.h>
struct Node
{
int data;
Node *next;
};
class LinkList
{
public:
LinkList();
LinkList(int a[],int n);
~LinkList();
int length();
void Get(int n);
void Insert(int i,int x);
int Delete(int i);
void PrintList();
private:
Node *first;
};
LinkList::LinkList()
{
first=new Node;
first->next=NULL;
}
LinkList::LinkList(int a[],int n)
{
Node *s;
first=new Node;
first->next=NULL;
for(int i=0;i<n;i++)
{
s=new Node;
s->data=a[i];
s->next=first->next;
first->next=s;
}
}
LinkList::~LinkList()
{
Node *q=NULL;
while(first!=NULL)
{
q=first;
first=first->next;
delete q;
}
}
void LinkList::PrintList()
{
Node *p;
p=first->next;
while(p!=NULL)
{
cout<<p->data<<endl;
p=p->next;
}
}
int LinkList::length()
{
Node *p=first->next;
int count=0;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}
void LinkList::Get(int i)
{
Node *p;
p=first->next;int count=1;
while(p!=NULL&&count<i)
{
p=p->next;
count++;
}
if(p==NULL)throw"位置";
else cout<<p->data<<endl;
}
void LinkList::Insert(int i,int x)
{
Node *p=first;
Node *s=NULL;
int count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(p==NULL)throw"位置";
else
{
s=new Node;
s->data=x;
s->next=p->next;
p->next=s;
}
}
int LinkList::Delete(int i)
{
Node *p=first,*q=NULL;
int x;
int count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(p==NULL||p->next==NULL)
throw"位置";
else
{
q=p->next;
x=q->data;
p->next=q->next;
delete q;
return x;
}
}
int main()
{
int a[5]={77,87,98,68,98};
LinkList Link(a,5);
Link.PrintList();
cout<<"在第三个位置插入成绩76"<<endl;
Link.Insert(3,76);
Link.PrintList();
cout<<endl;
Link.Delete(1);
Link.PrintList();
cout<<"第2个学生的成绩为";
Link.Get(2);
return 0;
}
struct Node
{
int data;
Node *next;
};
class LinkList
{
public:
LinkList();
LinkList(int a[],int n);
~LinkList();
int length();
void Get(int n);
void Insert(int i,int x);
int Delete(int i);
void PrintList();
private:
Node *first;
};
LinkList::LinkList()
{
first=new Node;
first->next=NULL;
}
LinkList::LinkList(int a[],int n)
{
Node *s;
first=new Node;
first->next=NULL;
for(int i=0;i<n;i++)
{
s=new Node;
s->data=a[i];
s->next=first->next;
first->next=s;
}
}
LinkList::~LinkList()
{
Node *q=NULL;
while(first!=NULL)
{
q=first;
first=first->next;
delete q;
}
}
void LinkList::PrintList()
{
Node *p;
p=first->next;
while(p!=NULL)
{
cout<<p->data<<endl;
p=p->next;
}
}
int LinkList::length()
{
Node *p=first->next;
int count=0;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}
void LinkList::Get(int i)
{
Node *p;
p=first->next;int count=1;
while(p!=NULL&&count<i)
{
p=p->next;
count++;
}
if(p==NULL)throw"位置";
else cout<<p->data<<endl;
}
void LinkList::Insert(int i,int x)
{
Node *p=first;
Node *s=NULL;
int count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(p==NULL)throw"位置";
else
{
s=new Node;
s->data=x;
s->next=p->next;
p->next=s;
}
}
int LinkList::Delete(int i)
{
Node *p=first,*q=NULL;
int x;
int count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(p==NULL||p->next==NULL)
throw"位置";
else
{
q=p->next;
x=q->data;
p->next=q->next;
delete q;
return x;
}
}
int main()
{
int a[5]={77,87,98,68,98};
LinkList Link(a,5);
Link.PrintList();
cout<<"在第三个位置插入成绩76"<<endl;
Link.Insert(3,76);
Link.PrintList();
cout<<endl;
Link.Delete(1);
Link.PrintList();
cout<<"第2个学生的成绩为";
Link.Get(2);
return 0;
}