实验11-2-4 删除单链表偶数节点（20 分）

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

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

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

int main()
{
    struct ListNode *head;

    head = createlist();
    head = deleteeven(head);
    printlist(head);

    return 0;
}

/* 你的代码将被嵌在这里 */

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

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

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

int main()
{
    struct ListNode *head;

    head = createlist();
    head = deleteeven(head);
    printlist(head);

    return 0;
}
struct ListNode *createlist()
{
    struct ListNode *p,*h,*q;   
    p=q=(struct ListNode*)malloc(sizeof(struct ListNode));
    h=(struct ListNode*)malloc(sizeof(struct ListNode));
    int data;   //存放数据
    h=p;    //h为头节点
    scanf("%d",&data);
    while(data!=-1)
    {
        p->data=data;    //保存数据
        q->next=p;   //p指向下一个节点
        q=p;
        p=(struct ListNode*)malloc(sizeof(struct ListNode));
        scanf("%d",&data);
    }
    q->next=NULL;  //尾节点Next指向空
    free(p);
    return h;
}
struct ListNode *deleteeven( struct ListNode *head )
{
    struct ListNode *p,*q;
    p=q=(struct ListNode*)malloc(sizeof(struct ListNode));
    p=head;
    q->next=p;
    while(p!=NULL)
    {
        if(!(p->data%2))     //能被二整除的为偶数
        {
            if(p==head)     //如果p是第一个节点就删除头节点，保留头指向的下一个节点作为头
            {
                head=head->next;
                p=head;
                q->next=p;
                continue;
            } 
            q->next=p->next;  //直接跳过偶数节点
        }
		else				//缺少else会导致重复偶数删除不了  			
	        q=p;
	        p=p->next;
    }
    free(p);
    return head;
}