链式表c语言程序,ÏßÐÔ±íµÄÁ´Ê½±íʾÓëʵÏÖ

1³õʼ»¯²Ù×÷

Status Init_L(LinkList L){

if (L=(LinkList *)malloc(sizeof(LNode))){L->next=NULL;return 1;}

else return 0;

}

2²åÈë²Ù×÷

Status ListInsert_L(LinkList &L,int i,ElemType e){

p=L,j=0;

while(p&&jnext;++j;}

if(!p||j>i-1) return ERROR;

s=(LinkList)malloc(sizeof(LNode));

s->data=e;s->next=p->next;

p->next=s;

return OK;

}//ListInsert_L

3ɾ³ý²Ù×÷

Status ListDelete_L(LinkList &L,int i,ElemType &e){

p=L,j=0;

while(p&&jnext;++j;}

if(!p->next||j>i-1) return ERROR;

q=p->next;p->next=q->next;

e=q->data;free(q);

return OK;

}//ListDelete_L

4ȡijÐòºÅÔªËصIJÙ×÷

Status GetElem_L(LinkList &L,int i,ElemType &e){

p=L->next,j=1;

while(p&&jnext;++j;}

if(!p||j>i) return ERROR;

e=p->data;

return OK;

}//GetElem_L

5¹é²¢Á½¸öµ¥Á´±íµÄËã·¨

void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc){

//ÒÑÖªµ¥Á´ÏßÐÔ±íLaºÍLbµÄÔªËØ°´Öµ·ÇµÝ¼õÅÅÁÐ

//¹é²¢ºóµÃµ½Ðµĵ¥Á´ÏßÐÔ±íLc,ÔªËØÒ²

°´Öµ·ÇµÝ¼õÅÅÁÐ

pa=La->next;pb=Lb->next;

Lc=pc=La;

while(pa&&pb){if(pa->data<=pb->data){pc->next=pa;pc=pa;pa=pa->next;

}else{pc->next=pb;pc=pb;pb=pb->next;}

}

pc->next=pa?pa:pb;

free(Lb);

}//MergeList_L

CÓïÑÔʵÏÖµÄÀý×Ó¡£