#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LinkedList{
int data;
struct LinkedList *next;
}LinkedList,*List,*List2,*List3;
int a[10]={1,2,3,4,5,6,7,8,9,10};
int n=10;
void build(List &L){
L=(List)malloc(sizeof(LinkedList));
LinkedList *s;
LinkedList *r=L;
for(int i=0;i<10;i++){
s=(LinkedList *)malloc(sizeof(LinkedList));
s->data=a[i];
r->next=s;
r=r->next;
}
r->next=NULL;
}
void show(List &L){
LinkedList *s=L->next;
while(s){
printf("%d ",s->data);
s=s->next;
}
}
void devide(List &L,List2 &L2){
L2=(List2)malloc(sizeof(LinkedList));//一定要先给L2分配空间才是给r2赋值
L2->next=NULL;
LinkedList *r=L;
LinkedList *r2=L2;
LinkedList *p=r->next;
r->next=NULL;
int i=0;//用来判断是单节点还是双节点
while(p){
i++;
if(i%2==0){
r2->next=p;
r2=r2->next;
}else{
r->next=p;
r=r->next;
}
p=p->next;
}
//循环完毕一定要把 两个链表的最后节点next置空
r->next=NULL;
r2->next=NULL;
}
int main(){
List L;
List L2;
build(L);
show(L);
printf("\n");
devide(L,L2);
show(L);
printf("\n");
show(L2);
return 0;
}