线性表-单链表

 #include <iostream>
 #include <string>
 #include <vector>
 #include <algorithm>
 using namespace std;
/*
单链表的操作 
*/
typedef struct LNode
{
	int data;
	struct LNode *next;
}LNode,*LinkList;
/*
初始化 
*/
int InitList(LinkList &L)
{
	L = new LNode;
	L->next = NULL;
	return 1;
}
/*
后插法创建单链表 
*/
void createList_R(LinkList &L,int n)
{
	LinkList r = L;//r 一直指向尾结点 
	for(int i=0;i<n;i++)
	{
		LinkList p = new LNode;
		cout<<"共"<<n<<"个数据，请输入第"<<i+1<<"个数据:"; 
		cin>>p->data;
		p->next = NULL;
		r->next = p;
		r = p; 
	}
}
/*查找为e的元素 
*/
LNode *locateElem(LinkList L,int e)
{
	LinkList p = L->next;
	while(p&&p->data!=e)
	{
		p=p->next;
	}
	cout<<"p的地址为："<<p<<endl; 
	return p;
}
/*取值 
*/
int getElem(LinkList L,int i,int &e)
{
	int j = 1;
	LinkList p = L->next;
	while(p&&j<i)
	{
		p = p->next;
		j++;
	}
	if(!p||j<i)
	{
		cout<<"getElem() err: ret 0"<<endl; 
		return 0;
	}
	e = p->data;
	return 1;	
}
/*插入 (Head)
*/
int ListInsert(LinkList &L,int i,int e)
{
	LinkList p = L;
	int j = 0;
	while(p&&j<i-1)
	{
		p = p->next;
		++j;
	}
	if(!p||j<i-1)
	{
		cout<<"ListInsert() err: ret 0"<<endl;
		return 0;
	}
	LinkList s = new LNode;
	s->data = e;
	s->next = p->next;
	p->next = s;
	return 1;
}
/*删除 
*/
int listDelete(LinkList &L,int i)
{
	LinkList p = L;
	int j = 0;
	while(p&&j<i-1)
	{
		p = p->next;
		++j;
	}
	if(i-1>j)
	{
		cout<<"listDelete() err:0 ret 0"<<endl; 
		return 0;
	}
	LinkList q = p->next;
	p->next = q->next;
	delete q;
	
	return 1;
}
 int main()
 {
 	 LinkList list = NULL;
 	 InitList(list);
 	 createList_R(list,5);
 	 locateElem(list,3);
 	 int e = 0;
 	 getElem(list,3,e);
 	 cout<<"取值："<<e<<endl; 
 	 ListInsert(list,1,12);
 	 listDelete(list,1);
   	 int j = 1;
 	 while(list->next!=NULL)
 	 {
 	 	cout<<"第"<<j<<"个元素为";
 	 	cout<<list->next->data<<endl;
 	 	list = list->next;
 	 	j++;
	  }
 }