代码语言
.
CSharp
.
JS
Java
Asp.Net
C
MSSQL
PHP
Css
PLSQL
Python
Shell
EBS
ASP
Perl
ObjC
VB.Net
VBS
MYSQL
GO
Delphi
AS
DB2
Domino
Rails
ActionScript
Scala
代码分类
文件
系统
字符串
数据库
网络相关
图形/GUI
多媒体
算法
游戏
Jquery
Extjs
Android
HTML5
菜单
网页交互
WinForm
控件
企业应用
安全与加密
脚本/批处理
开放平台
其它
【
C
】
链表的基本操作
作者:
Dezai.CN
/ 发布于
2011/8/1
/
534
(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>
试试其它关键字
链表
同语言下
.
获取手机通讯录 iOS去除数字以外的所有字符
.
异步加载音乐等资源
.
交通罚单管理系统
.
freemark实现,简单的替换
.
计算斐波那契数列
.
base64解码 包括解码长度
.
图像显示
.
冒泡排序
.
输入十进制数,输出指定进制
.
链式栈
可能有用的
.
C#实现的html内容截取
.
List 切割成几份 工具类
.
SQL查询 多列合并成一行用逗号隔开
.
一行一行读取txt的内容
.
C#动态修改文件夹名称(FSO实现,不移动文件)
.
c# 移动文件或文件夹
.
c#图片添加水印
.
Java PDF转换成图片并输出给前台展示
.
网站后台修改图片尺寸代码
.
处理大图片在缩略图时的展示
Dezai.CN
贡献的其它代码
(
4037
)
.
多线程Socket服务器模块
.
生成随机密码
.
清除浮动样式
.
弹出窗口居中
.
抓取url的函数
.
使用base HTTP验证
.
div模拟iframe嵌入效果
.
通过header转向的方法
.
Session操作类
.
执行sqlite输入插入操作后获得自动编号的ID
Copyright © 2004 - 2024 dezai.cn. All Rights Reserved
站长博客
粤ICP备13059550号-3