删除单链表中的偶数节点

本题要求实现两个函数，分别将读入的数据存储为单链表、将链表中偶数值的结点删除。链表结点定义如下：

```typedef struct node {
    datatype  data;
    struct node *next;
};LNode,*LinkList
函数接口定义：
LinkList createlist();
LinkList deleteeven( LinkList H );
函数createlist从标准输入读入一系列正整数，按照读入顺序建立单链表。当读到−1时表示输入结束，函数应返回指向单链表头结点的指针。
函数deleteeven将单链表H中偶数值的结点删除，返回结果链表的头指针。
裁判测试程序样例：

```c
```#include <stdio.h>
#include <stdlib.h>
typedef int Datatype; 
typedef struct node{
    Datatype data;
    struct node *next;
}LNode,*LinkList;

LinkList createlist();
LinkList deleteeven( LinkList H );
void printlist( LinkList H )
{
     LinkList p = H->next;
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}

int main()
{
    LinkList H;

    H = createlist();
    h = deleteeven(H);
    printlist(H);

    return 0;
}

/* 请在这里填写答案 */
输入样例：1 2 2 3 4 5 6 7 -1
输出样例：1 3 5 7

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

typedef int datatype;

typedef struct node {
    datatype data;
    struct node* next;
} LNode, *LinkList;

LinkList createlist() {
    LinkList head = NULL;
    LinkList tail = NULL;
    int value;

    while (1) {
        scanf("%d", &value);
        if (value == -1)
            break;

        LinkList newNode = (LinkList)malloc(sizeof(LNode));
        newNode->data = value;
        newNode->next = NULL;

        if (head == NULL) {
            head = newNode;
            tail = newNode;
        } else {
            tail->next = newNode;
            tail = newNode;
        }
    }

    return head;
}

LinkList deleteeven(LinkList H) {
    if (H == NULL)
        return NULL;

    while (H != NULL && H->data % 2 == 0) {
        LinkList temp = H;
        H = H->next;
        free(temp);
    }

    LinkList current = H;
    while (current != NULL && current->next != NULL) {
        if (current->next->data % 2 == 0) {
            LinkList temp = current->next;
            current->next = temp->next;
            free(temp);
        } else {
            current = current->next;
        }
    }

    return H;
}


void printlist( LinkList H )
{
     LinkList p = H->next;
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}
 
int main()
{
    LinkList H;
 
    H = createlist();
    h = deleteeven(H);
    printlist(H);
 
    return 0;
}