网站首页
网站导航
Ctrl+D收藏
首 页
代码段
源码包
文档库
工具箱
代码语言
.
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
/
779
<div> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 设一个递增有序顺序表L，将x插入L中，使L仍有序。</span><span style="color: rgb(0,128,0)">*/</span><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;</span><span style="color: rgb(0,0,255)">#define</span><span style="color: rgb(0,0,0)"> INITSIZE 100</span><span style="color: rgb(0,0,0)">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)">{ ElemType </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">elem; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> initsize; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> length;}SqList;</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> CreatSL(SqList </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){ L.elem</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)"> ElemType[INITSIZE]; L.initsize</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">INITSIZE; L.length</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)">请按从小到大输入顺序表的元素：</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl; </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(128,0,128)">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)">L.length;i</span><span style="color: rgb(0,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)">L.elem[i]; 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)">endl; </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)"> 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)">;j</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.length;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.elem[j]</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)">; cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Insert(SqList L,ElemType e){ </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)">0</span><span style="color: rgb(0,0,0)">; </span><span style="color: rgb(0,0,255)">while</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)">L.length)</span><span style="color: rgb(0,0,0)">&&</span><span style="color: rgb(0,0,0)">(L.elem[i]</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">e)) i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">; </span><span style="color: rgb(0,0,255)">if</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)">L.length) { </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)"> j</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.length;j</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)">i;j</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">)</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">用法一</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)"> L.elem[j]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.elem[j</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)">]; L.elem[i]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">e; </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)">//用法二 for(int j=L.length-1;j>i-1;j--) L.elem[j+1]=L.elem[j]; L.elem[i]=e; </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)"> } </span><span style="color: rgb(0,0,255)">else</span><span style="color: rgb(0,0,0)"> L.elem[L.length]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">e; L.length</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.length</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)">; 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)">endl; </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)"> k</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)">;k</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.length;k</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.elem[k]</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)">; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</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 e; SqList 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)">请输入顺序表的元素个数：</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(0,0,0)">endl; cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">n; CreatSL(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)">请输入要插入的元素：</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)">e; Insert(L,e);}</span></pre> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 设一个递减有序顺序表L，将x插入L中，使L仍有序。</span><span style="color: rgb(0,128,0)">*/</span><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;</span><span style="color: rgb(0,0,255)">#define</span><span style="color: rgb(0,0,0)"> INITSIZE 100</span><span style="color: rgb(0,0,0)">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)">{ ElemType </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">elem; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> initsize; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> length;}SqList;</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> CreatSL(SqList </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){ L.elem</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)"> ElemType[INITSIZE]; L.initsize</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">INITSIZE; L.length</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)">请按从大到小输入顺序表的元素：</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">; </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(128,0,128)">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)">L.length;i</span><span style="color: rgb(0,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)">L.elem[i]; 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,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)"> 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)">;j</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.length;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.elem[j]</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)">; cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Insert(SqList L,ElemType e){ </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)">0</span><span style="color: rgb(0,0,0)">; </span><span style="color: rgb(0,0,255)">while</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)">L.length)</span><span style="color: rgb(0,0,0)">&&</span><span style="color: rgb(0,0,0)">(L.elem[i]</span><span style="color: rgb(0,0,0)">>=</span><span style="color: rgb(0,0,0)">e)) i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">; </span><span style="color: rgb(0,0,255)">if</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)">L.length) { </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)"> j</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.length;j</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)">i;j</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">)</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">用法一</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)"> L.elem[j]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.elem[j</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)">]; L.elem[i]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">e; </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)">//用法二 for(int j=L.length-1;j>i-1;j--) L.elem[j+1]=L.elem[j]; L.elem[i]=e; </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)"> } </span><span style="color: rgb(0,0,255)">else</span><span style="color: rgb(0,0,0)"> L.elem[L.length]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">e; L.length</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.length</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)">; 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,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)"> k</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)">;k</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.length;k</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.elem[k]</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)">; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</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 e; SqList 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)">请输入顺序表的元素个数：</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; CreatSL(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)">请输入要插入的元素：</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)">e; Insert(L,e);}</span></pre> </div> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)">2.11 ①设A和B是两个递增有序的单链表，把他们归并成一个递减有序的单链表C，②并要求辅助空间为O（1）。(这道题处于极度变态的边沿中，让我怀疑它还是题目吗，还是题目有误。我个人认为，条件①和条件②，不能同时达成，要把两个递增的有序表合并成一个递减的有序链表则辅助空间就不可能为O（1）。辅助空间要为O（1）的话就只能合并成递增的有序表，这纯属我个人研究结果，要是哪位做得出来两个条件都符合的话，记得告诉我一下啊！)以下代码为：把两个递增有序的链表归并为一个递减有序链表</span><span style="color: rgb(0,128,0)">*/</span><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)"> CreatList(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) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">创立链表</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)">{ LinkList p,q; 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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">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)">请从小到大输入链表的元素：</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">; </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(128,0,128)">1</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(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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; q</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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> CreatC(LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">A,LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">B,LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">C,</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">合并链表</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)">{ C</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; C</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; LinkList p,q,t; p</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(0,0,0)">next; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">B</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,0)">&&</span><span style="color: rgb(0,0,0)">q) { t</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; </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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data) { t</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)">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)">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)">else</span><span style="color: rgb(0,0,0)"> { t</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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } t</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)">C</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; C</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)">t; } </span><span style="color: rgb(0,0,255)">while</span><span style="color: rgb(0,0,0)">(p) { t</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; t</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)">p</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data; t</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)">C</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; C</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)">t; 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)">while</span><span style="color: rgb(0,0,0)">(q) { t</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; t</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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data; t</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)">C</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; C</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)">t; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } 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)">; p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">C</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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main(){ LinkList A,B,C; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n,m,k; 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***的长度：</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; CreatList(A,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)">请输入链表***B***的长度：</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)">m; CreatList(B,m); k</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">m</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(0,0,0)">n; CreatC(A,B,C,k); }</span></pre> </div> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 2.11 ①设A和B是两个递增有序的单链表，把他们归并成一个递减有序的单链表C，②并要求辅助空间为O（1）。(这道题处于极度变态的边沿中，让我怀疑它还是题目吗，还是题目有误。我个人认为，条件①和条件②，不能同时达成，要把两个递增的有序表合并成一个递减的有序链表则辅助空间就不可能为O（1）。辅助空间要为O（1）的话就只能合并成递增的有序表，这纯属我个人研究结果，要是哪位做得出来两个条件都符合的话，记得告诉我一下啊！)</span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)"></span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">以下代码为：把两个递增有序的单链表归并为一个递增有序的链表，辅助空间为O（1）</span><span style="color: rgb(0,128,0)"></span><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)"> CreatList(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) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">创立链表</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)">{ LinkList p,q; 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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">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)">请从小到大输入链表的元素：</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">; </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(128,0,128)">1</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(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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; q</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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> CreatC(LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">A,LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">B,LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">C,</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">合并链表</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)">{ LinkList p,q,t; p</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(0,0,0)">next; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">B</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; C</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">t</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">A; </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,0)">&&</span><span style="color: rgb(0,0,0)">q) { </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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data) { t</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; t</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p; 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)">else</span><span style="color: rgb(0,0,0)"> { t</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)">q; t</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } } t</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,0)">?</span><span style="color: rgb(0,0,0)">p:q; delete B; 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)">; p</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">C</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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main(){ LinkList A,B,C; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n,m,k; 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***的长度：</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; CreatList(A,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)">请输入链表***B***的长度：</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)">m; CreatList(B,m); k</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">m</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(0,0,0)">n; CreatC(A,B,C,k); }</span></pre> </div> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 2.12 设L是递增有序单链表，删除其中大于min且小于max的元素结点，并释放结点空间。(有点部分和上次那份上机题的那道C卷的不一样，用法简单一点，大家看一下)</span><span style="color: rgb(0,128,0)">*/</span><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)"> CreatList(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){ LinkList p,q; 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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">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)">; </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(128,0,128)">1</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(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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; q</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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Find(LinkList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L,ElemType min,ElemType max,</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n){ LinkList p,t; 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,255)">while</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)">((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)">data</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)">min)</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,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)">max)) { t</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; 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)">t</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; delete t; n</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">; } </span><span style="color: rgb(0,0,255)">else</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; } } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main(){ LinkList L; </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n; ElemType min,max; 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)">; cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">n; CreatList(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)">请输入min的值：</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)">min; 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)">请输入max的值：</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)">max; Find(L,min,max,n);}</span></pre> </div> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 2.13 将单链表中值重复的结点删除，使所得的单链表中各结点值均不同。</span><span style="color: rgb(0,128,0)">*/</span><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)"> CreatLN(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){ 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; LinkList p,q; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">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)">请输入链表元素：</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">; </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(128,0,128)">1</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(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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; q</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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> delet(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){ LinkList p,q,t,w; 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) { t</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p; q</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)">while</span><span style="color: rgb(0,0,0)">(q) { </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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">data) {q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next;t</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">t</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)">else</span><span style="color: rgb(0,0,0)"> { w</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q; t</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)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">t</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; delete w; n</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; } 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)">; 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)">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)"> j</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(0,0,0)">n;j</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) { 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; } cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main(){ LinkList L; </span><span style="color: rgb(0,0,255)">int</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)">请输入链表的元素个数:</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; CreatLN(L,n); delet(L,n);}</span></pre> </div> <div class="cnblogs_code"> <pre><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)">建立一个数据为整数的单链表L,然后将该链表中的数据域值最小的那个结点移到链表的最前端第一步：建立一个单链表第2： 显示该单链表第3： 查找链表中数据域最小的值，并将它移到到链表的最前端第4： 显示该单链表</span><span style="color: rgb(0,128,0)">*/</span><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;</span><span style="color: rgb(0,0,255)">#define</span><span style="color: rgb(0,0,0)"> LIST_INIT_SIZE 100 </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">存储空间初始分配量</span><span style="color: rgb(0,0,0)"></span><span style="color: rgb(0,0,255)">#define</span><span style="color: rgb(0,0,0)"> LIST_INCREMENT 10 </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">存储空间增补量</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)">线性表方法类</span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">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,128,0)">//</span><span style="color: rgb(0,0,0)"> </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; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,0,0)">}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,128,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)"> InitList_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){ </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">构造空单链表L</span><span style="color: rgb(0,128,0)"></span><span style="color: rgb(0,0,0)"> LinkList p; 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; 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)">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(128,0,128)">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)">n;</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">i){ 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,128,0)">//</span><span style="color: rgb(0,128,0)">InitList_L</span><span style="color: rgb(0,128,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)"> PrintList(LinkList L){ LinkList p; 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)">; 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)"> FindList(LinkList L){ LinkList o,p,q; 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; o</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)">int</span><span style="color: rgb(0,0,0)"> n</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,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)">(n</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) { n</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; q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">p; } 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; } 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)">; cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">n</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl; 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(0,0,0)">n</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,255)">while</span><span style="color: rgb(0,0,0)">(o) { </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(o</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)">n) { LNode </span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">o;o</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">q</span><span style="color: rgb(0,0,0)">-></span><span style="color: rgb(0,0,0)">next; delete q; } </span><span style="color: rgb(0,0,255)">else</span><span style="color: rgb(0,0,0)"> { cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">o</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)">; o</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">o</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)"> main(){ </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n; 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</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; InitList_L(L,n); PrintList(L); FindList(L); cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;}</span></pre> </div> </div>
评论列表
本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。
试试其它关键字
表和链表的操作
同语言下
.
获取手机通讯录 iOS去除数字以外的所有字符
.
异步加载音乐等资源
.
交通罚单管理系统
.
freemark实现，简单的替换
.
计算斐波那契数列
.
base64解码 包括解码长度
.
图像显示
.
冒泡排序
.
输入十进制数，输出指定进制
.
链式栈
可能有用的
.
SQL查询 多列合并成一行用逗号隔开
.
一行一行读取txt的内容
.
C#动态修改文件夹名称(FSO实现，不移动文件)
.
c# 移动文件或文件夹
.
c#图片添加水印
.
Java PDF转换成图片并输出给前台展示
.
网站后台修改图片尺寸代码
.
处理大图片在缩略图时的展示
.
实现对图片上传的接收
.
判断用户输入的是否为IP地址
Dezai.CN
贡献的其它代码
(
4037
)
.
多线程Socket服务器模块
.
生成随机密码
.
清除浮动样式
.
弹出窗口居中
.
抓取url的函数
.
使用base HTTP验证
.
div模拟iframe嵌入效果
.
通过header转向的方法
.
Session操作类
.
执行sqlite输入插入操作后获得自动编号的ID
地图
本站
我们
服务
版权
联系
回馈
博客