【数据结构】单链表的基本操作

1. 定义单链表

//定义单链表 
typedef struct LNode{
	int data;
	struct LNode *next;
}LNode, *LinkList;

2. 初始化单链表

//初始化单链表
bool InitList(LinkList &L){
	L = (LNode *)malloc(sizeof(LNode));
	if(L == NULL)
		return false;
	L->next = NULL;
	return true;
} 

3. 用头插法建立单链表

//用头插法建立单链表
LinkList List_HeadInsert(LinkList &L){
	int x;
	cin>>x;
	while(x != -1){
		LNode *s = (LNode *)malloc(sizeof(LNode));
		s->data = x;
		s->next = L->next;
		L->next = s;
		cin>>x;
	} 
	return L;
} 

4. 按位查找

//按位查找
int GetElem(LinkList L, int i){
	LNode *s = L;
	int j = 0;
	while(s != NULL && j < i){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return 0;
	return s->data;
} 

5. 按值查找

//按值查找
int LocateElem(LinkList L, int e){
	LNode *s = L->next;
	int j = 1;
	while(s != NULL){
		if(s->data == e)
			return j;
		s = s->next;
		j++;
	}
	return 0;
} 

6. 插入操作

//插入操作 
bool ListInsert(LinkList &L, int i, int e){
	if(L == NULL)
		return false;
	LNode *s = L;
	int j = 0;
	while(s != NULL && j < i - 1){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return false;
	LNode *p = (LNode *)malloc(sizeof(LNode));
	p->data = e;
	p->next = s->next;
	s->next = p;
	return true;
}

7. 删除操作

//删除操作
bool ListDelete(LinkList &L, int i, int &e){
	if(L == NULL)
		return false;
	LNode *s = L->next;
	int j = 1;
	while(s != NULL && j < i - 1){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return false;
	LNode *p = s->next;
	s->next = p->next;
	e = p->data;
    free(p);
	return true;
} 

8. 链表长度

//链表长度 
int ListLength(LinkList L){
	int j = 0;
	if(L == NULL)
		return 0;
	LNode *s = L->next;
	while(s != NULL){
		s = s->next;
		j++;
	}
	return j;	
}

9. 完整代码

#include<iostream>
#include<stdlib.h> 
using namespace std;

//定义单链表 
typedef struct LNode{
	int data;
	struct LNode *next;
}LNode, *LinkList;
//初始化单链表
bool InitList(LinkList &L){
	L = (LNode *)malloc(sizeof(LNode));
	if(L == NULL)
		return false;
	L->next = NULL;
	return true;
} 
//用头插法建立单链表
LinkList List_HeadInsert(LinkList &L){
	int x;
	cin>>x;
	while(x != -1){
		LNode *s = (LNode *)malloc(sizeof(LNode));
		s->data = x;
		s->next = L->next;
		L->next = s;
		cin>>x;
	} 
	return L;
} 
//按位查找
int GetElem(LinkList L, int i){
	LNode *s = L;
	int j = 0;
	while(s != NULL && j < i){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return 0;
	return s->data;
} 
//按值查找
int LocateElem(LinkList L, int e){
	LNode *s = L->next;
	int j = 1;
	while(s != NULL){
		if(s->data == e)
			return j;
		s = s->next;
		j++;
	}
	return 0;
} 
//插入操作 
bool ListInsert(LinkList &L, int i, int e){
	if(L == NULL)
		return false;
	LNode *s = L;
	int j = 0;
	while(s != NULL && j < i - 1){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return false;
	LNode *p = (LNode *)malloc(sizeof(LNode));
	p->data = e;
	p->next = s->next;
	s->next = p;
	return true;
}
//删除操作
bool ListDelete(LinkList &L, int i, int &e){
	if(L == NULL)
		return false;
	LNode *s = L->next;
	int j = 1;
	while(s != NULL && j < i - 1){
		s = s->next;
		j++;
	}
	if(s == NULL)
		return false;
	LNode *p = s->next;
	s->next = p->next;
	e = p->data;
    free(p);
	return true;
} 
//链表长度 
int ListLength(LinkList L){
	int j = 0;
	if(L == NULL)
		return 0;
	LNode *s = L->next;
	while(s != NULL){
		s = s->next;
		j++;
	}
	return j;	
}
void PrintList(LinkList L){
	LNode *s = L->next;
	while(s != NULL){
		cout<<s->data<<" ";
		s = s->next;
	}
	cout<<endl;
}
int main(){
	LinkList L;
	InitList(L);
	ListInsert(L, 1, 2);
	ListInsert(L, 2, 4);
	ListInsert(L, 6, 1);
	PrintList(L);
	ListInsert(L, 2, 5);
	ListInsert(L, 1, 1);
	PrintList(L);
	cout<<"当前顺序表长度："<<ListLength(L)<<endl;
	int e;
	ListDelete(L, 4, e);
	cout<<"删除的元素e为："<<e<<endl;
	cout<<"当前顺序表长度："<<ListLength(L)<<endl;
	PrintList(L);
	cout<<"查找元素1的位置"<<LocateElem(L, 1)<<endl;
	cout<<"查找元素5的位置"<<LocateElem(L, 5)<<endl;
	List_HeadInsert(L);
	PrintList(L);
    return 0;
}