代码:
void split(LinkList* L){
LinkList* L1;//odd
LinkList* L2;//even
LinkList* p;
LinkList *rear1,*rear2;
p = L->next;// work next pointer
L1 = L;//如果将A分成两个链表 B和C则 new LinkList;
L2 = new LinkList;
rear1 = L1,rear2 = L2;
int counter = 1;
while(p!=NULL){
//尾插法
if(counter%2 == 1){
rear1->next = p;//rear的后继指向P
rear1 = p;//rear后移到P节点
}else{
rear2->next = p;
rear2 = p;
}
counter++;
p = p->next;
}
rear1->next = NULL;
rear2->next = NULL;
}
结果: