关于数据结构单向链表的各种操作
关于节点数据添加：
尾添加
最核心的是定义一个头指针和一个尾指针（尾指针可以不定义但是会增加代码的重复性，增加程序运行时间）；
关于尾添加：（注意区分有节点和无节点的情况）
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void endadd(struct Mystruct **phead,struct Mystruct **pend, int aDDData);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
endadd(&phead,&pend,4);
......
return 0;
}
void endadd(struct Mystruct **phead,struct Mystruct **pend, int adddata)
{
struct Mystruct *pt = (struct Mystruct *)malloc(sizeof(struct Mystruct));
if(NULL == pt)
return;
pt->data = adddata;
pt->pnext = NULL;
if(NULL == *phead)
{
*phead = pt;
}
else
{
(*pend)->pnext = pt;
}
*pend= pt;
}头添加
关于代码思路与尾添加基本一致，注意区分节点的链接：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void head_add(struct Mystruct **phead,struct Mystruct **pend, int adddata);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
head_add(&phead,&pend,4);
......
return 0;
}
void head_add(struct Mystruct **phead,struct Mystruct **pend, int adddata)
{
struct Mystruct *pt = (struct Mystruct *)malloc(sizeof(struct Mystruct));
if(NULL == pt)
return;
pt->data = adddata;
pt->pnext = NULL;
if(NULL == *phead)
{
*pend = pt;
}
else
{
pt->pnext = (*phead);
}
*phead= pt;
}一次性添加n个x数据节点：
利用循坏，直接调用头添加或者尾添加：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void circulate_add(struct Mystruct **phead,struct Mystruct **pend, int adddata);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
circulate_add(&phead,&pend,4,5);
......
return 0;
}
void circulate_add(struct Mystruct **phead,struct Mystruct **pend, int count, int adddata);
{
for(int i = 0;i<count;i++)
{
endadd(phead, pend, adddata);
}
}关于查找：
根据指定数据：
核心就是通过头指针一个一个往下走找到指定节点的数据与所找数据是否匹配，最重要的是要使用中间变量记录头指针，否则就无法找到头指针了（因为是单项链表）：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void data_find(struct Mystruct *phead, int designated_data);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
middle_data_find(phead,4);
......
return 0;
}
void data_find(struct Mystruct* phead, int designated_data)
{
if (NULL == phead)
return;
struct Mystruct* ptemp = phead;
while (ptemp != NULL)
{
if (ptemp->data == designated_data)
{
printf("找到了");
break;
}
ptemp = ptemp->pnext;
}
return;
}根据下标查找：
思路基本不变；区别传入指定下标；内部定义一个计数器，当下标和计数器数值相等；表示链表存在这个节点；可以选择传出或者提醒；大家思考一下，动手实践一下。
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
struct Mystruct *index_find(struct Mystruct *phead, int index);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
middle_data_find(phead,4);
......
return 0;
}
struct Mystruct* index_find(struct Mystruct* phead, int index)
{
if (NULL == phead||index<0)
return NULL;
struct Mystruct* ptemp = phead;
int i = 0;
for (i = 0; i < index; i++)
{
ptemp = ptemp->pnext;
}
return ptemp;
}删除头节点：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void deleat_head(struct Mystruct **phead,struct Mystruct **pend);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
deleat_head(&phead)
......
return 0;
}
void deleat_head(struct Mystruct** phead, struct Mystruct** pend)
{
if (NULL == *phead)
return;
struct Mystruct* pt = *phead;
if ((*phead)->pnext == NULL)
{
free(pt);
*phead = NULL;
*pend = NULL;
}
else
{
*phead = (*phead)->pnext;
free(pt);
}
}
void deleat_end(struct My删除尾节点：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void deleat_end(struct Mystruct**phead,struct Mystruct**pend);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
deleat_head(&phead)
......
return 0;
}
void deleat_end(struct Mystruct** phead, struct Mystruct** pend)
{
if (NULL == *phead)
return;
struct Mystruct* pt = *phead;
if (pt->pnext == NULL)
{
free(pt);
*phead = NULL;
*pend = NULL;
}
else
{
while (pt->pnext != (*pend))
{
if (pt->pnext == (*pend))
{
free(*pend);
*pend = pt;
pt->pnext = NULL;
pt = pt->pnext;
}
}
}
}删除中间节点：
这里思路改变一下：根据数据或者下标找到前一个节点，改变前一个节点的pnext指针的指向，直接指向下一个节点，也就是这个节点的pnext；简单示范一下删除中间指定数据：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void deleat_middlledata(struct Mystruct**phead,struct Mystruct**pend,int deleatdata);
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
deleat_head(&phead)
......
return 0;
}
void deleat_middlledata(struct Mystruct**phead,struct Mystruct**pend,int deleatdata)
{
if (NULL == *phead)
return;
struct Mystruct* pt = *phead;
if (pt->pnext == NULL)
{
free(pt);
*phead = NULL;
*pend = NULL;
}
}删除全部节点：
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct Mystruct
{
int data;
struct Mystruct *pnext;
};
void deleat_all(struct Mystruct** phead, struct Mystruct** pend)
int main(void)
{
struct Mystruct *phead = NULL;
struct Mystruct *pend= NULL;
deleat_all(&phead,&pend)
......
return 0;
}
void deleat_all(struct Mystruct** phead, struct Mystruct** pend)
{
while (*phead!= NULL)
{
struct Mystruct* pt = *phead;
*phead = (*phead)->pnext;
free(pt);
}
*phead = NULL;
*pend = NULL;
}到此这篇关于关于数据结构单向链表的各种操作的文章就介绍到这了,更多相关数据结构单向链表操作内容请搜索以前的文章或继续浏览下面的相关文章希望大家以后多多支持！
相关文章