PTA 习题11-7 奇数值结点链表 (20分)

本题要求实现两个函数，分别将读入的数据存储为单链表、将链表中奇数值的结点重新组成一个新的链表。链表结点定义如下：

struct ListNode {
int data;
ListNode *next;
};

函数接口定义：

struct ListNode *readlist();
struct ListNode *getodd( struct ListNode
**L );

函数readlist从标准输入读入一系列正整数，按照读入顺序建立单链表。当读到−1时表示输入结束，函数应返回指向单链表头结点的指针。

函数getodd将单链表L中奇数值的结点分离出来，重新组成一个新的链表。返回指向新链表头结点的指针，同时将L中存储的地址改为删除了奇数值结点后的链表的头结点地址（所以要传入L的指针）。

输入样例：

1 2 2 3 4 5 6 7 -1

输出样例：

1 3 5 7
2 2 4 6

#include <stdio.h>
#include <stdlib.h>

struct ListNode {
    int data;
    struct ListNode *next;
};

struct ListNode *readlist();
struct ListNode *getodd( struct ListNode **L );
void printlist( struct ListNode *L )
{
     struct ListNode *p = L;
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}

int main()
{
    struct ListNode *L, *Odd;
    L = readlist();
    Odd = getodd(&L);
    printlist(Odd);
    printlist(L);

    return 0;
}

/* 你的代码将被嵌在这里 */
struct ListNode *readlist(){
    struct ListNode *headnode = (struct ListNode*)malloc(sizeof(struct ListNode));
    struct ListNode *p = (struct ListNode*)malloc(sizeof(struct ListNode));
    struct ListNode *newnode = NULL;
    headnode->data = 0;
    headnode->next = NULL;
    p = headnode;
    int n;
    scanf("%d", &n);
    while(n!=-1){
        newnode= (struct ListNode*)malloc(sizeof(struct ListNode));
        newnode->data = n;
        newnode->next = p->next;
        p->next = newnode;
        p = p->next;
        scanf("%d", &n);
    }
    return headnode->next;
}

struct ListNode *getodd( struct ListNode **L ){
    struct ListNode *headnode = (struct ListNode*)malloc(sizeof(struct ListNode));
    struct ListNode *headnode2 = (struct ListNode*)malloc(sizeof(struct ListNode));
    struct ListNode *p = NULL, *newnode = NULL, *p1 = NULL, *p2 = NULL;
    headnode2->next = *L;
    p1 = headnode2;
    p2 = headnode2->next;
    headnode->data = 0;
    headnode->next = NULL;
    p = headnode;
    while (p2){
        if(p2->data%2!=0){
            newnode = (struct ListNode *)malloc(sizeof(struct ListNode));
            newnode->data = p2->data;
            newnode->next = p->next;
            p->next = newnode;
            p = p->next;

            p1->next = p1->next->next;
            free(p2);
            p2 = p1->next;
        }else{
            p1 = p1->next;
            p2 = p2->next;
        }
    }
    *L = headnode2->next;
    return headnode->next;
}