数据结构实验之链表五：单链表的拆分

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 struct node
 4 {
 5     int data;
 6     struct node *next;
 7 };
 8 int main()
 9 {
10     int n,i,a,b,x;
11     a=b=0;
12     struct node *head1,*head2,*p,*q,*tail1,*tail2;
13     scanf("%d",&n);
14     head1=(struct node *)malloc(sizeof(struct node));
15     head2=(struct node *)malloc(sizeof(struct node));
16     head1->next=NULL;
17     head2->next=NULL;
18     tail1=head1;
19     tail2=head2;
20           for(i=0; i<n; i++)
21     {
22         scanf("%d",&x);
23         if(x%2==0)
24         {
25             p=(struct node *)malloc(sizeof(struct node));
26             p->data=x;
27             p->next=NULL;
28             tail1->next=p;
29             tail1=p;
30             a++;
31         }
32         else
33         {
34             q=(struct node *)malloc(sizeof(struct node));
35             q->data=x;
36             q->next=NULL;
37             tail2->next=q;
38             tail2=q;
39             b++;
40         }
41     }
42     printf("%d %d\n",a,b);
43     for(p=head1->next; p!=NULL; p=p->next)
44     {
45         if(p->next==NULL)
46         {
47             printf("%d\n",p->data);
48         }
49         else printf("%d ",p->data);
50     }
51     for(p=head2->next; p!=NULL; p=p->next)
52     {
53         if(p->next==NULL)
54         {
55             printf("%d\n",p->data);
56         }
57         else printf("%d ",p->data);
58     }
59     return 0;
60 }