链表的基本操作代码,C代码库,德仔网

代码语言
代码分类
【C】链表的基本操作
作者:Dezai.CN / 发布于2011/8/1/ 512
(1) 建立一个单链表，并写一个函数来显示链表中的元素（2）在一个单链表中查找元素X,找到,显示其序号,否则显示”未找到”
<div><span style="color: rgb(0,0,0)">#include</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">iostream</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)">
</span><span style="color: rgb(0,0,255)">using</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">namespace</span><span style="color: rgb(0,0,0)"> std;
typedef </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> ElemType;

typedef </span><span style="color: rgb(0,0,255)">struct</span><span style="color: rgb(0,0,0)"> LNode
{
 ElemType data;
 </span><span style="color: rgb(0,0,255)">struct</span><span style="color: rgb(0,0,0)"> LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">next;
}LNode;
typedef LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">LinkList;

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> InitList_L(LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L)
{
 L</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,255)">new</span><span style="color: rgb(0,0,0)"> LNode;
 L</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">NULL;
}

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> CreateList_L(LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L,</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n)
{
 InitList_L(L);
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">n;i</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">;</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">i)
 {
 LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,255)">new</span><span style="color: rgb(0,0,0)"> LNode;
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data;
 p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;
 L</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p;
 }
}

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> print(LinkList L)
{
 LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,255)">new</span><span style="color: rgb(0,0,0)"> LNode;
 p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;
 </span><span style="color: rgb(0,0,255)">while</span><span style="color: rgb(0,0,0)">(p) 
 {
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;
 }
 
}

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Find(LinkList L,ElemType a)
{
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">,j</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">;
 LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,255)">new</span><span style="color: rgb(0,0,0)"> LNode;
 p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;
 </span><span style="color: rgb(0,0,255)">while</span><span style="color: rgb(0,0,0)">(p)
 {
 </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data</span><span style="color: rgb(0,0,0)">==</span><span style="color: rgb(0,0,0)">a)
 {
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">您要查找的数据 </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">a</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> 在单链表中为 </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">i</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> 号元素！\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">;
 }
 i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">;
 p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;
 }
 </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(j</span><span style="color: rgb(0,0,0)">==</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">)
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">您要查找的数据不在单链表中！\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
}

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main()
{
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n;
 ElemType a;
 LinkList L;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">请输入您要输入的单链表的数据个数n:\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">n;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">请输入(逆序输入)您要输入的数据：\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 CreateList_L(L,n);
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">依次输出链表中的数据为:\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 print(L);
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">请输入您要查找的数据a:\n</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">a;
 Find(L,a);
}</span></div>
评论列表
本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。
试试其它关键字
　链表　
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)