数据结构与算法笔记（一）单链表

class Link
{
public:
int element;
Link *next;
public:
Link(int e,Link*nextval=NULL)
{
element=e;
next=nextval;
}
Link(Link *nextval=NULL)
{
next=nextval;
}
};
#include<iostream>
using namespace std;
#include"Link.h"
class LList
{
private:
Link *head;
Link *fence;
Link *tail;
//int lenth;
public:
LList()
{
head=fence=tail=new Link;
}
~LList()
{
fence=head;
while(fence!=NULL)
{
Link *temp=fence;
fence=fence->next;
delete temp;
}
}
void insert( const int &e)
{
fence->next=new Link(e,fence->next);
if(fence==tail)
tail=fence->next;
}
void append(const int &e)
{
tail->next=new Link(e,NULL);
tail=tail->next;
}
bool remove(int & it)
{
if(fence->next==NULL)
return false;
Link *temp=fence->next;
fence->next=temp->next;
it=temp->element;
delete temp;
if(fence->next==NULL)
tail=fence;
return true;
}
bool setpos(int pos)
{
fence=head; //pos未进行范围检查
//if(pos<1||pos>list_len())
// return false;
for(int i=1;i<pos;i++)
fence=fence->next;
return true;
}
void printlist()
{
fence=head;
while((fence->next)!=NULL)
{
fence=fence->next;
printf("%d ",fence->element);
}
}
};
void main()
{
int a[5]={1,2,3,4,5};
LList list;
for (int i=0;i<5;i++)
{
list.insert(a[i]);
}
list.printlist();
}