单链表的排序与合并
输入两个链表,将各链表排序,然后将其合并成一个链表。
1、链表结构
//有序链表A,B合到Avoid mergerLinkList(LinkList A, LinkList B){ Node *LA = A->next; Node *LB = B->next; Node *LR = A; while(LA != NULL && LB != NULL) { if(LA->data <= LB->data) { LR->next = LA; LR = LR->next; LA = LA->next; } else { LR->next = LB; LR = LR->next; LB = LB->next; } } if(LA) { LR->next = LA; } else { LR->next = LB; }}
//~END~