单链表的简单实现

//单链表的简单实现
#include <iostream>
#include <stdlib.h>
#define MaxSize 50
#define ElemType char
using namespace std;
//结构定义
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LinkList;
//头插法构造单链表
void CreateListF(LinkList *&L,ElemType a[],int n)
{
LinkList *s;
int i;
L=(LinkList*)malloc(sizeof(LinkList));
L->next=NULL;
for(i=0;i<n;i++)
{
s=(LinkList*)malloc(sizeof(LinkList));
s->data=a[i];
s->next=L->next;
L->next=s;
}
}

//尾插法构造单链表
void CreateListR(LinkList *&L,ElemType a[],int n)
{
LinkList *s,*r;
int i;
L=(LinkList *)malloc(sizeof(LinkList));
L->next=NULL;
r=L;
for(i=0;i<n;i++)
{
s=(LinkList*)malloc(sizeof(LinkList));
s->data=a[i];
s->next=NULL;
r->next=s;
r=s;
}

}

//定位元素
int LocateElem(LinkList *L,ElemType e)
{
LinkList *p=L->next;
int n=1;
while(p!=NULL&&p->data!=e)
{
n++;
p=p->next;
}
if(p==NULL) return 0;
else return n;
}

//插入元素
int Insert(LinkList *&L,ElemType e,int i)
{
int j=1;
LinkList *s,*pre=L,*p=pre->next;
while(p!=NULL&&j!=i)
{
j++;
pre=p;
p=p->next;
}
if(p==NULL&&j!=i)
return 0;
else
{
s=(LinkList*)malloc(sizeof(LinkList));
s->data=e;
s->next=p;
pre->next=s;
return 1;
}
}

//删除操作
int Delet(LinkList *&L,ElemType e)
{
LinkList *pre=L,*p=pre->next;
while(p!=NULL&&p->data!=e)
{
pre=p;
p=p->next;
}
if(p==NULL)
return 0;
else
{
pre->next=p->next;
free(p);
return 1;
}
}

int main()
{
ElemType a[10]={'d','g','w','v','h','k','e','w','t','u'};
LinkList *L ;
CreateListF(L,a,10);
LinkList *p=L->next;
cout<<"构造好之后的链表中的元素为：";
while(p!=NULL)
{
cout<<p->data<<"  ";
p=p->next;
}
cout<<endl;

cout<<"h在链表的位置为:"<<LocateElem(L,'h')<<endl;

Insert(L,'p',4 );
cout<<"在位置4处插入'p'后链表的元素为：";
p=L->next;
while(p!=NULL)
{
cout<<p->data<<"  ";
p=p->next;
}
cout<<endl;

Delet(L,'t');
cout<<"删除元素't'之后的链表元素为：";
p=L->next;
while(p!=NULL)
{
cout<<p->data<<"  ";
p=p->next;
}
cout<<endl;
}