单链表按序号奇偶分链表

将一个带头结点的单链表按序号的奇偶分为两个链表：headA，headB，并保持顺序不变.

#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
    int data;
    struct node* next;
}LinkList;
LinkList* CreaList()//创建一个新链表
{
    LinkList*head,*r,*s;
    head = (struct LinkList*)malloc(sizeof (LinkList));
    r = head;
    int x;
    scanf("%d",&x);
    while(x != -100)//以-100为结束标志
    {
        s = (struct LinkList*)malloc(sizeof (LinkList));
        s->data = x;
        r->next = s;
        r = s;
        scanf("%d",&x);

    }
    r->next = NULL;

    return head;
}
void PrintList(LinkList* head)//打印链表
{
    LinkList* p = head;
    p = p->next;
    while(p!=NULL)
    {
        printf("%d ",p->data);
        p = p->next;
    }
    printf("\n");
    return 0;
}
LinkList* Selet(LinkList* head)
{
    LinkList* r,*s,*cur;
    int i = 0;//计数
    LinkList* headB = (struct LinkList*)malloc(sizeof(LinkList));
    r = head;
    s = headB;
    cur = head->next;
    r->next = NULL;

    while(cur !=NULL)
    {
        i++;
        if(i%2!=0)//奇数序号
        {
            r->next = cur;
            r = cur;
        }
        else//偶数序号
        {
            s->next = cur;
            s = cur;
        }
         cur = cur->next;
    }
    r->next = NULL;
    s->next = NULL;
    return headB;
}
int main()
{
    LinkList* head,*headA,*headB;
    head = CreaList();
    PrintList(head);
   	PrintList(head);//奇数序号打印
    PrintList(headB);//偶徐序号打印

   
    return 0;
}