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

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

Problem Description

输入N个整数顺序建立一个单链表，将该单链表拆分成两个子链表，第一个子链表存放了所有的偶数，第二个子链表存放了所有的奇数。两个子链表中数据的相对次序与原链表一致。
Input

第一行输入整数N;；
第二行依次输入N个整数。
Output

第一行分别输出偶数链表与奇数链表的元素个数；
第二行依次输出偶数子链表的所有数据；
第三行依次输出奇数子链表的所有数据。
Sample Input

10
1 3 22 8 15 999 9 44 6 1001
Sample Output

4 6
22 8 44 6
1 3 15 999 9 1001

#include <stdio.h>
struct node
{
    int data;
    struct node *next;
}*head, *q, *p, *tail, *head1, *head2, *p1, *p2;

struct node *creat(int n)
{
    head = (struct node *)malloc(sizeof(struct node));
    head -> next = NULL;
    tail = head;

    while(n--)
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d",&p -> data);
        p -> next = NULL;
        tail -> next = p;
        tail = p;
    }
    return head;
}
void display(struct node *head)
{
    p = head -> next;
    while(p)
    {
        if(p -> next) printf("%d ",p -> data);
        else          printf("%d\n",p -> data);
        p = p -> next;
    }
}

int main()
{
    int n, odd = 0, even = 0;
    scanf("%d",&n);
    head1 = creat(n);
    head2 = (struct node *)malloc(sizeof(struct node));
    head2 -> next = NULL;
    p = head1 -> next;
    p1 = head1;
    p2 = head2;
    while(p)
    {
        if(p -> data % 2)
        {
            p2 -> next = p;
            p2 = p;
            p1 -> next = p -> next;
            p = p -> next;
            p2 -> next = NULL;
            even++;
        }
        else
        {
            p1 = p1 -> next;
            p = p -> next;
            odd++;
        }
    }
    printf("%d %d\n",odd,even);
    display(head1);
    display(head2);
    return 0;
}