链表完整操作
头文件
#include<stdio.h>
#include<stdlib.h>
typedef int SqlElemType;
typedef int Status;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
单链表的存储结构
typedef struct L_list {
SqlElemType data;
struct L_list* next;
}Lnode, * LinkedList;
单链表的初始化
Status InitList(LinkedList* L)
{
(*L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
return OK;
}
判断链表是否为空
Status IsEmptyList(LinkedList L)
{
if (L->next)
{
return 0;
}
else
return 1;
}
销毁单链表
Status DestroyList(LinkedList* L)
{
LinkedList p;
while (*L)
{
p = *L;
(*L) = (*L)->next;
free(p);
}
return OK;
}
清空链表
Status ClearList(LinkedList* L)
{
LinkedList p = (*L)->next;
LinkedList q;
while (p)
{
q = p->next;
free(p);
p = q;
}
(*L)->next = NULL;
return OK;
}
求单链表的表长
int ListLength(LinkedList L)
{
LinkedList p;
p = L->next;
int i = 0;
while (p)
{
i++;
p = p->next;
}
return i;
}
取单链表中第i个元素的值
Status GetElem_L(LinkedList L, int i,SqlElemType *e)
{
int count = 1;
LinkedList p=L->next;
while (p && count<i)
{
p = p->next;
count++;
}
if (!p||count>i)
return ERROR;
*e = p->data;
return OK;
}
按值查找–根据指定数据获取该数据所在位置(地址)
LinkedList LocateElem_L(LinkedList L, SqlElemType e)
{
LinkedList p = L->next;
while (p && p->data != e)
{
p = p->next;
}
return p;
}
按值查找–根据指定数据获取该数据位置序号
int LocateElem_LL(LinkedList L, SqlElemType e)
{
LinkedList p = L->next;
int j = 1;
while (p && p->data != e)
{
p = p->next;
j++;
}
if (p)
return j;
else
return 0;
}
插入
Status InsertList(LinkedList* L, int i, SqlElemType e)
{
int count = 0;
LinkedList p;
p = (*L);
while (p && count < i-1)
{
count++;
p = p->next;
}
if (!p || count > i-1)
return ERROR;
LinkedList s = (LinkedList)malloc(sizeof(Lnode));
s->data = e;
s->next = p->next;
p->next = s;
return OK;
}
删除
Status DeleteList(LinkedList* L, int i, SqlElemType* e)
{
LinkedList p = (*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
if (count > i - 1 || !(p->next))
return ERROR;
LinkedList q = p->next;
*e = q->data;
p->next = q->next;
free(q);
return OK;
}
创建链表–头插法
void CreateList_h(LinkedList* L, int n)
{
(* L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
LinkedList p;
for (int i = n; i > 0; i--)
{
p= (LinkedList)malloc(sizeof(Lnode));
scanf("%d", &(p->data));
p->next = (*L)->next;
(*L)->next = p;
}
}
创建链表–尾插法
void CreateList_tail(LinkedList* L, int n)
{
(*L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
LinkedList r = *L;
for (int i = 0; i < n; i++)
{
LinkedList p= (LinkedList)malloc(sizeof(Lnode));
scanf("%d", &(p->data));
p->next = NULL;
r->next = p;
r = p;
}
}
带尾指针循环链表的合并
LinkedList Connect(LinkedList Ta, LinkedList Tb)
{
LinkedList p = Ta->next;
Ta->next = Tb->next->next;
free(Tb->next);
Tb->next = p;
return Tb;
}
双向链表
typedef struct DuLNode {
SqlElemType data;
struct DuLNode* prior, * next;
}DuLNode,*DuLinkedList;
双向链表的插入
void InsertList_Du(DuLinkedList* L, int i, SqlElemType e)
{
DuLinkedList p = (*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
DuLinkedList s = (DuLinkedList)malloc(sizeof(DuLNode));
s->data = e;
s->next = p->next;
s->prior = p;
p->next->prior = s;
p->next = s;
}
双向链表的删除
void DeleteList_Du(DuLinkedList* L, int i, SqlElemType* e)
{
DuLinkedList p=(*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
*e = p->next->data;
p->next = p->next->next;
p->next->prior = p;
free(p->next);
}
输出链表
void OutputList(LinkedList L)
{
LinkedList p = L;
while (p->next)
{
printf("%d ", p->next->data);
p = p->next;
}
printf("\n");
}
验证代码是否正确(主函数部分)
int main()
{
int a,n;
Lnode List;
LinkedList LL = &List;
LinkedList* L = &LL;
a=InitList(L);
printf("单链表的初始化\n");
printf("%d\n", a);
printf("初始化完成\n");
a=IsEmptyList(LL);
printf("判断链表是否为空\n");
printf("%d\n", a);
printf("输入链表的值的个数\n");
scanf("%d", &n);
printf("创建链表--头插法,请倒序输入想要的值\n");
CreateList_h(L, n);
printf("输出链表\n");
OutputList(LL);
a = ListLength(LL);
printf("求单链表的表长\n");
printf("%d\n", a);
printf("插入\n");
printf("输入要在第几个结点前插入,插入的值为几\n");
int i, e;
scanf("%d%d", &i, &e);
InsertList(L, i, e);
printf("输出链表\n");
OutputList(LL);
printf("删除\n");
printf("输入要删除第几个结点\n");
scanf("%d", &i);
DeleteList(L, i, &e);
printf("删除的值为%d\n", e);
printf("输出链表\n");
OutputList(LL);
printf("取单链表中第i个元素的值,输入i\n");
scanf("%d", &i);
GetElem_L(LL, i, &e);
printf("第%d个元素的值为%d\n", i, e);
printf("按值查找--根据指定数据获取该数据所在位置(地址)\n");
printf("输入查找的值:\n");
scanf("%d", &i);
LinkedList p=LocateElem_L(LL, i);
printf("该数据所在位置(地址)为%p\n", p);
printf("按值查找--根据指定数据获取该数据位置序号\n");
printf("输入查找的值:\n");
scanf("%d", &i);
int l = LocateElem_LL(LL, i);
printf("该数据所在位置序号为%d\n", l);
printf("清空链表\n");
a=ClearList(L);
printf("%d\n", a);
printf("清空链表完成\n");
a = IsEmptyList(LL);
printf("判断链表是否为空\n");
printf("%d\n", a);
printf("链表为空\n");
printf("输出链表\n");
OutputList(LL);
printf("销毁单链表\n");
a=DestroyList(L);
printf("%d\n", a);
printf("链表销毁完成\n");
return 0;
}
运行结果
![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/3b7fa483b2b54520a131a30fdfe1b0fc.png)
完整代码
#include<stdio.h>
#include<stdlib.h>
typedef int SqlElemType;
typedef int Status;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
typedef struct L_list{
SqlElemType data;
struct L_list* next;
}Lnode,*LinkedList;
Status InitList(LinkedList* L)
{
(*L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
return OK;
}
Status IsEmptyList(LinkedList L)
{
if (L->next)
{
return 0;
}
else
return 1;
}
Status DestroyList(LinkedList* L)
{
LinkedList p;
while (*L)
{
p = *L;
(* L) = (*L)->next;
free(p);
}
return OK;
}
Status ClearList(LinkedList* L)
{
LinkedList p=(*L)->next;
LinkedList q;
while (p)
{
q = p->next;
free(p);
p = q;
}
(*L)->next = NULL;
return OK;
}
int ListLength(LinkedList L)
{
LinkedList p;
p = L->next;
int i = 0;
while (p)
{
i++;
p = p->next;
}
return i;
}
Status GetElem_L(LinkedList L, int i,SqlElemType *e)
{
int count = 1;
LinkedList p=L->next;
while (p && count<i)
{
p = p->next;
count++;
}
if (!p||count>i)
return ERROR;
*e = p->data;
return OK;
}
LinkedList LocateElem_L(LinkedList L, SqlElemType e)
{
LinkedList p = L->next;
while (p && p->data != e)
{
p = p->next;
}
return p;
}
int LocateElem_LL(LinkedList L, SqlElemType e)
{
LinkedList p = L->next;
int j = 1;
while (p && p->data != e)
{
p = p->next;
j++;
}
if (p)
return j;
else
return 0;
}
Status InsertList(LinkedList* L, int i, SqlElemType e)
{
int count = 0;
LinkedList p;
p = (*L);
while (p && count < i-1)
{
count++;
p = p->next;
}
if (!p || count > i-1)
return ERROR;
LinkedList s = (LinkedList)malloc(sizeof(Lnode));
s->data = e;
s->next = p->next;
p->next = s;
return OK;
}
Status DeleteList(LinkedList* L, int i, SqlElemType* e)
{
LinkedList p = (*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
if (count > i - 1 || !(p->next))
return ERROR;
LinkedList q = p->next;
*e = q->data;
p->next = q->next;
free(q);
return OK;
}
void CreateList_h(LinkedList* L, int n)
{
(* L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
LinkedList p;
for (int i = n; i > 0; i--)
{
p= (LinkedList)malloc(sizeof(Lnode));
scanf("%d", &(p->data));
p->next = (*L)->next;
(*L)->next = p;
}
}
void CreateList_tail(LinkedList* L, int n)
{
(*L) = (LinkedList)malloc(sizeof(Lnode));
(*L)->next = NULL;
LinkedList r = *L;
for (int i = 0; i < n; i++)
{
LinkedList p= (LinkedList)malloc(sizeof(Lnode));
scanf("%d", &(p->data));
p->next = NULL;
r->next = p;
r = p;
}
}
LinkedList Connect(LinkedList Ta, LinkedList Tb)
{
LinkedList p = Ta->next;
Ta->next = Tb->next->next;
free(Tb->next);
Tb->next = p;
return Tb;
}
typedef struct DuLNode {
SqlElemType data;
struct DuLNode* prior, * next;
}DuLNode,*DuLinkedList;
void InsertList_Du(DuLinkedList* L, int i, SqlElemType e)
{
DuLinkedList p = (*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
DuLinkedList s = (DuLinkedList)malloc(sizeof(DuLNode));
s->data = e;
s->next = p->next;
s->prior = p;
p->next->prior = s;
p->next = s;
}
void DeleteList_Du(DuLinkedList* L, int i, SqlElemType* e)
{
DuLinkedList p=(*L);
int count = 0;
while (p->next && count < i - 1)
{
p = p->next;
count++;
}
*e = p->next->data;
p->next = p->next->next;
p->next->prior = p;
free(p->next);
}
void OutputList(LinkedList L)
{
LinkedList p = L;
while (p->next)
{
printf("%d ", p->next->data);
p = p->next;
}
printf("\n");
}
int main()
{
int a,n;
Lnode List;
LinkedList LL = &List;
LinkedList* L = &LL;
a=InitList(L);
printf("单链表的初始化\n");
printf("%d\n", a);
printf("初始化完成\n");
a=IsEmptyList(LL);
printf("判断链表是否为空\n");
printf("%d\n", a);
printf("输入链表的值的个数\n");
scanf("%d", &n);
printf("创建链表--头插法,请倒序输入想要的值\n");
CreateList_h(L, n);
printf("输出链表\n");
OutputList(LL);
a = ListLength(LL);
printf("求单链表的表长\n");
printf("%d\n", a);
printf("插入\n");
printf("输入要在第几个结点前插入,插入的值为几\n");
int i, e;
scanf("%d%d", &i, &e);
InsertList(L, i, e);
printf("输出链表\n");
OutputList(LL);
printf("删除\n");
printf("输入要删除第几个结点\n");
scanf("%d", &i);
DeleteList(L, i, &e);
printf("删除的值为%d\n", e);
printf("输出链表\n");
OutputList(LL);
printf("取单链表中第i个元素的值,输入i\n");
scanf("%d", &i);
GetElem_L(LL, i, &e);
printf("第%d个元素的值为%d\n", i, e);
printf("按值查找--根据指定数据获取该数据所在位置(地址)\n");
printf("输入查找的值:\n");
scanf("%d", &i);
LinkedList p=LocateElem_L(LL, i);
printf("该数据所在位置(地址)为%p\n", p);
printf("按值查找--根据指定数据获取该数据位置序号\n");
printf("输入查找的值:\n");
scanf("%d", &i);
int l = LocateElem_LL(LL, i);
printf("该数据所在位置序号为%d\n", l);
printf("清空链表\n");
a=ClearList(L);
printf("%d\n", a);
printf("清空链表完成\n");
a = IsEmptyList(LL);
printf("判断链表是否为空\n");
printf("%d\n", a);
printf("链表为空\n");
printf("输出链表\n");
OutputList(LL);
printf("销毁单链表\n");
a=DestroyList(L);
printf("%d\n", a);
printf("链表销毁完成\n");
return 0;
}