简述链表原理
类似于这样,用结构体建立起每个节点的联系,即next中存放下一个节点的地址
struct Test
{
int data;//用于存放数据
struct Test *next;//用于存放下一个节点的头
};
![链表](https://img-blog.csdnimg.cn/20201126185802415.png#pic_center
添加节点
删除节点
用链表简单实现添加,删除,打印功能。
上代码啦。。。
/*
* @Author: Aaron
* @Date: 2020-11-26 18:28:25
*/
#include<stdio.h>
#include<stdlib.h>
struct Test
{
int data;//用于存放数据
struct Test *next;//用于存放下一个节点的头
};
//获取链表节点个数
int getLinkNum(struct Test *head)
{
int num=1;
while(head->next != NULL){
num++;
head = head->next;
}
return num;
}
//删除节点,只需要把节点指向需要删除节点的下一个节点
struct Test* delData(struct Test *head,int data)
{
struct Test *p = head;
if(p->data == data){
p = p->next;
printf("delate head data is true\n");
return head;
}
while(p->next !=NULL){
if(p->next->data == data){
p->next = p->next->next;
printf("delate data is true\n");
return head;
}
p = head->next;
}
printf("delate data is false\n");
return head;
}
//在指定节点前面添加一个节点
struct Test* insertFormFor(struct Test *head,int data,struct Test *new)
{
struct Test *p = head;
if(p->data == data){
new->next = p;
return new;
}
while(p->next !=NULL){
if(p->next->data == data){
new->next = p->next;
p->next= new;
printf("your insert is true\n");
return head;
}
p = p->next;
}
printf("your insert is false\n");
return head;
}
//在指定节点后面添加一个节点
struct Test* insertData(struct Test *head,int data,struct Test *new)
{
struct Test *p = head;
if(p->data == data){
new->next = p;
return new;
}
while(p->next != NULL)
{
if(p->data == data){
new->next = p->next;
p->next = new;
printf("your insert is true\n");
return head;
}
p = p->next;
}
printf("your insert is false\n");
return head;
}
//打印所有节点
int printLink(struct Test *head)
{
struct Test *point;
point = head;
while(point != NULL)
{
printf("%d",point->data);
point = point->next;
}
putchar('\n');
}
int main()
{
int i;
struct Test t1 = {1,NULL};
struct Test t2 = {2,NULL};
struct Test t3 = {3,NULL};
struct Test t4 = {4,NULL};
struct Test t5 = {5,NULL};
struct Test * head;
struct Test new = {1025,NULL};
struct Test new2 = {1124,NULL};
head = &t1;
t1.next = &t2;
t2.next = &t3;
t3.next = &t4;
t4.next = &t5;
printLink(head);
//一共多少节点
i = getLinkNum(head);
printf("The num is: %d\n",i);
//在data等于2后面插入新节点
head = insertData(head,2,&new);
printLink(head);
head = insertFormFor(head,4,&new2);
printLink(head);
/*head = delData(head,3);
printLink(head);*/
}
水平不高,能力有限,将就着看就好。
如果有幸您的看到,并且能帮到您,我感到非常荣幸。