编程实现：输入若干个正整数（输入-1为结束标志），建立一个单向链表，将其中的偶数值结点删除后输出。链表节点定义为： struct Node{ int data; struct Node *next; } 输入输出示例：括号内为说明 输入样例: 1 2 3 4 5 6 7 -1 输出样例: 1 3 5 7 用c语言程序写代码

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

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

int main() {
    int num;
    struct Node *head = NULL;
    struct Node *tail = NULL;
    struct Node *p = NULL;
    struct Node *prev = NULL;

    // 建立单向链表
    while (1) {
        scanf("%d", &num);
        if (num == -1) {
            break;
        }
        p = (struct Node *)malloc(sizeof(struct Node));
        p->data = num;
        p->next = NULL;
        if (head == NULL) {
            head = p;
            tail = p;
        } else {
            tail->next = p;
            tail = p;
        }
    }

    // 删除偶数节点
    p = head;
    while (p != NULL) {
        if (p->data % 2 == 0) {
            if (p == head) {
                head = p->next;
                free(p);
                p = head;
            } else {
                prev->next = p->next;
                free(p);
                p = prev->next;
            }
        } else {
            prev = p;
            p = p->next;
        }
    }

    // 输出链表
    p = head;
    while (p != NULL) {
        printf("%d ", p->data);
        p = p->next;
    }
    printf("\n");

    // 释放内存
    p = head;
    while (p != NULL) {
        prev = p;
        p = p->next;
        free(prev);
    }

    return 0;
}