奇数值结点链表

/*
    QQ:7878138708
    date:2020年5月16日
    奇数值结点链表
 */
#include <stdio.h>
#include <stdlib.h>

struct ListNode {
    int data;
    struct ListNode *next;
};
struct ListNode *readlist(void);
struct ListNode *getodd(struct ListNode **L);
void printlist(struct ListNode *L);
int main(void)
{
    struct ListNode *L, *Odd;
    L = readlist();
    
    Odd = getodd(&L);
    printlist(Odd);
    printlist(L);
    
    return 0;
}
//新建一个链表
struct ListNode *readlist(void)
{
    struct ListNode *head, *tail, *p;
    int n;
    head = tail = NULL;     //表头、表尾都为空
    scanf("%d", &n);
    while (n != -1) {
        //新建一个结点
        p = (struct ListNode *)malloc(sizeof(struct ListNode));
        p->data = n;
        p->next = NULL;
        
        if (head == NULL) {
            head = tail = p;
        }
        else
        {
            tail->next = p;
            tail = p;
        }
        
        scanf("%d", &n);
    }
    
    return head;
}
void printlist(struct ListNode *L)
{
    struct ListNode *p = L;
        
    while (p != NULL) {
        printf("%d ", p->data);
        p = p->next;
    }
    
    printf("\n");
}
struct ListNode *getodd(struct ListNode **L)
{
    struct ListNode *oddHead, *oddTail;     //奇数链表头尾
    struct ListNode *evenHead, *evenTail;   //偶数链表头尾
    struct ListNode *p, *temp;
    
    oddHead = oddTail = NULL;
    evenHead = evenTail = NULL;
    p = *L;
    //遍历原来的链表
    while (p) {
        temp = p;
        p = p->next;
        //结点值为奇数
        if (temp->data % 2) {
            if (oddHead == NULL) {
                oddHead = temp;
                oddHead->next = NULL;
                oddTail = oddHead;
            } else {
                oddTail->next = temp;
                oddTail = oddTail->next;
                oddTail->next = NULL;
            }
        } else {
            if (evenHead == NULL) {
                evenHead = temp;
                evenHead->next = NULL;
                evenTail = evenHead;
            } else {
                evenTail->next = temp;
                evenTail = evenTail->next;
                evenTail->next = NULL;
            }
        }
    }
    *L = evenHead;
    
    return oddHead;
}