C/C++程序开发（03）：链式物理结构（元素查找、元素删除、元素插入）

最新推荐文章于 2020-10-16 00:10:34 发布

薛桂琴

最新推荐文章于 2020-10-16 00:10:34 发布

阅读量582

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++语言文章标签：链式物理结构C++

本文链接：https://blog.youkuaiyun.com/m1m2m3mmm/article/details/77875268

C/C++语言专栏收录该内容

22 篇文章

订阅专栏

本文详细介绍了链表的基本操作，包括节点的初始化与显示、查找指定数值的节点位置、插入新节点以及删除特定节点等过程，并提供了完整的C语言实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <cstdio>
#include <cstdlib>
struct node{
int iNum;
node* pNext;
};
int main()
{
//一个节点的初始化与显示
node node1 = {15};
printf("%d", node1.iNum);
//输出两个节点
node node2 = {19};
node1.pNext = &node2;
node head = {0};
node tail = {0};
head.pNext = &node1;
node2.pNext = &tail;
tail.pNext = NULL;
for (node* p_node = &node1; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;
node* p_last = p_mid->pNext;
if(p_mid != &tail)
{
printf("%d ",p_mid->iNum);
}
}
printf("\n");
//查找节点
int tmp1 = 19, cnt1 = 1;
for (node* p_node = &head; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;
node* p_last = p_mid->pNext;
if (p_mid->iNum == tmp1)
{
printf("%d是第%d个节点\n", p_mid->iNum, cnt1);
break;
}
cnt1++;
}
printf("\n");
//插入一个节点
node node3 = {16};
for (node* p_node = &head; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;

node* p_last = p_mid->pNext;

//是尾节点直接插入，否则插入到p_first和p_mid之间

if (p_mid == &tail || p_mid->iNum > node3.iNum)
{
p_first->pNext = &node3;
node3.pNext = p_mid;
break;
}
}
for (node* p_node = &head; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;
node* p_last = p_mid->pNext;
if (p_mid != &tail)
{
printf("%d",p_mid->iNum);
}
}
printf("\n");
//删除一个元素
for (node* p_node = &head; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;

node* p_last = p_mid->pNext;

//删除的不能是尾节点

if (p_mid != &tail && p_mid->iNum == 16)
{
p_first->pNext = p_last;
break;
}
}
for (node* p_node = &head; p_node != &tail; p_node = p_node->pNext)
{
node* p_first = p_node;
node* p_mid = p_first->pNext;
node* p_last = p_mid->pNext;
if (p_mid != &tail)
{
printf("%d",p_mid->iNum);
}
}
return 0;
}