数据结构上机编程汇总.doc

数据结构上机编程汇总 2-1链表 #includeiostream.h #includemalloc.h #includestdlib.h #includestdio.h #define TURE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFLOW -2 #define NULL 0 typedef int Status; typedef int ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode, *LinkList; Status GetElem_L(LinkList L, int i, ElemType e){ //L涓哄甫澶寸粨鐐圭殑鍗曢摼琛ㄧ殑澶存寚閽堛€? //褰撶i涓厓绱犲瓨鍦ㄦ椂锛屽叾鍊艰祴缁檈骞惰繑鍥濷K锛屽惁鍒欒繑鍥濫RROR LinkList *p; int j; p = L-next; j = 1; //鍒濆鍖栵紝p鎸囧悜绗竴涓粨鐐癸紝j涓鸿鏁板櫒 while(p ji){ //椤烘寚閽堝悜鍚庢煡鎵撅紝鐭儔亾p鎸囧悜绗噼煱饏鷯绱犳垨p煱擑┖ p = p-next; ++j; } if(!p || ji) return ERROR; //绗噼煱饏鷯绱鸞笉鄆姃湪 e = p-data; //鍙瀬i鍏冪礌 return OK; }// GetElem_L Status ListInsert_L(LinkList L, int i, ElemType e){ //鍦ㄥ甫澶寸粨鐐圭殑鍗曢摼绾挎€觥↙涓i涓綅缃箣鍓嶆彃鍏儑殑鍏檖礌e LinkList *p, *s; p = L; j = 0; while(p ji-1){p = p-next; ++j;} //瀵绘氒绗噼-1煱粨鐐? if(!p || ji-1) return ERROR; //i灏忎簬1鎴栬€呭ぇ浜庤〃闀?1 s = (LinkList)malloc(sizeof(LNode));//鐢熸垚鏂扮粨鐐? s-data = e; s-next = p-next;//鎻掑叆L涓? p-next = s; return OK; }// ListInsert_L Status ListDelete_L(LinkList L, int i, ElemType e){ //鍦ㄥ甫澶寸粨鐐圭殑鍗曢摼绾挎€觥↙涓紝鍒犻櫎绗琲涓厓绱狅紝骞舵湁e杩斿洖鍏跺€? LinkList *p,*q; int j; p = L; j= 0; while(p-next ji-1){//瀵绘壘绗琲涓粨鐐癸紝骞朵护p鎸囧悜鍏跺墠瓒? p = p-next; ++j; } if(!(p-next)||ji-1) return ERROR;//鍒犻櫎浣嶇疆涓嶅悎鐞? q = p-next; p-next = q-next; //鍒犻櫎骞堕噴鏀剧粨鐐? e = q-data; free(q); return OK; }// ListDelete_L void CreateList_L(LinkList L, int n){ //閫嗕綅搴忚緭鍏涓厓绱犵殑鍊硷紝寤虹珛甯﹁〃澶寸粨鐐圭殑鍗曢摼绾挎€觥↙ LinkList *p; L = (LinkList)malloc(sizeof(LNode)); L-next = NULL;//鍏堝缓绔嬩竴涓甫澶寸粨鐐圭殑鍗曢摼琛? for(i = n; i 0; --i){ p=(LinkList)malloc(sizeof(LNode));//鐢熸垚鏂扮粨鐐? scanf(%d,p-data); p-next = L-next; L-next = p; } }//CreateList_L void MergeList_L(LinkList La, LinkList Lb, LinkList Lc){ //宸茬煡鍗曢摼绾挎€觥↙a鍜孡b鐨勫厓绱犳寜鍊奸潪閫掑噺鎺掑垪 //褰掑苟La鍜孡b寰楀埌鏂扮殑鍗曢摼绾挎€觥↙c锛孡c鐨勫厓绱犱篃鎸夊€奸潪閫掑噺鎺掑垪 LinkList *pa , *pb , *pc; pa = L