链表必学算法(三):归并法

/*归并法:用于合并两个链表*/ /* * SCs in different cases * author: Whywait */ typedef struct node { Elemtype data; struct node* next; } Lnode; /*case ONE*/ Lnode* merge1(Linklist& LA, Linklist& LB) { // merge two sorted Singly linked lists // LA, LB and the return one ( LC ) all have a head node // all the