递增有序的顺序表代码,C代码库,德仔网

代码语言
代码分类
【C】递增有序的顺序表
作者:Dezai.CN / 发布于2011/8/1/ 540
(1) 将两个递增有序的顺序表合并为一个递增有序的顺序表，并显示(2) 将顺序表L逆置
<div>把两个递增有序的单链表归并为一个递增有序的链表，辅助空间为O（<span style="color: rgb(128,0,128)">1</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)">请从小到大输入链表的元素：</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)
{
 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></div>
试试其它关键字
　顺序表　
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)