顺序表的操作代码,C代码库,德仔网

代码语言
代码分类
【C】顺序表的操作
作者:Dezai.CN / 发布于2011/8/1/ 577
(1) 在一个递增有序的顺序表中插入一个元素,使插入之后仍有序 (2) 将顺序表L逆置
<div><span style="color: rgb(0,0,0)">#include </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">stdlib.h</span><span style="color: rgb(128,0,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.h</span><span style="color: rgb(0,0,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; 

</span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 顺序表定义，书20 </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_INIT_SIZE 100 </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)"> LISTINCREMENT 10</span><span style="color: rgb(0,0,0)">
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)"> length;
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> listsize;
} SqList;

</span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 生成具有n个元素的顺序表 L,类似书P21,算法2_1 </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)"> Creat_Sq(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[LIST_INIT_SIZE];
 </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)">) L.elem[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)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">2</span><span style="color: rgb(0,0,0)">*</span><span style="color: rgb(0,0,0)">i;</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.length</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">n;
 L.listsize</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">LIST_INIT_SIZE;
}

</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Increament(SqList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L)
{</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)"> ElemType </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,255)">new</span><span style="color: rgb(0,0,0)"> ElemType[L.listsize</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(0,0,0)"> LISTINCREMENT];
</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)">) a[i]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.elem[i];
delete []L.elem;
L.elem</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">a;
L.listsize</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.listsize</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(0,0,0)"> LISTINCREMENT;
}

 
</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> ListInsert_Sq(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)"> i,ElemType e) {
</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">将e插入到顺序表L中第i个元素之前</span><span style="color: rgb(0,128,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(128,0,128)">1</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)">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)">ERROR</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;exit(</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)">);}

 </span><span style="color: rgb(0,0,255)">if</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.listsize) Increament(L);
 

 ElemType</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)">(L.elem[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)">]);
 </span><span style="color: rgb(0,0,255)">for</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)"> p</span><span style="color: rgb(0,0,0)">=&</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(128,0,128)">1</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,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(128,0,128)">1</span><span style="color: rgb(0,0,0)">)</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)">q</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">e;

 </span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">L.length;

}



</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)">
</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main()
{ SqList L;
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i,e,m;
 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;
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">m;
 
 </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 生成具有n个元素的顺序表L</span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 Creat_Sq( L, m);
 
 </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)">
 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)"><<</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)"> (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)">L.length;i</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(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)">L.elem[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)">];

 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,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;
 cin</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)">e;
 
 </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 在L中插入元素e , 注意函数调用的格式</span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 ListInsert_Sq (L,i,e);

 </span><span style="color: rgb(0,0,255)">for</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)">L.length;i</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(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)">L.elem[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)">];
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </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)">
 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)">(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(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)">)
 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)">L.elem[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)">];
 
}


</span></div>
试试其它关键字
　顺序表　
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)