本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中偶数值的结点删除。链表结点定义如下:
struct ListNode {
int data;
struct ListNode *next;
};
函数接口定义:
struct ListNode *createlist();
struct ListNode *deleteeven( struct ListNode *head );
裁判测试程序样例:
#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;
}
/* 你的代码将被嵌在这里 */
输入样例:
1 2 2 3 4 5 6 7 -1
输出样例:
1 3 5 7
以下是代码:
struct ListNode *createlist()//根据测试程序的输出,判断是无头结点的链表
{
int num;
struct ListNode *p;
struct ListNode *L=(struct ListNode*)malloc(sizeof(struct ListNode));
L=NULL;
p=L;
scanf("%d",&num);
while(num!=-1)
{
struct ListNode *newnode=(struct ListNode*)malloc(sizeof(struct ListNode));
newnode->data=num;
if(L==NULL)
{
newnode->next=L;
L=newnode;
p=L;
}
else
{
p->next=newnode;
p=newnode;
}
scanf("%d",&num);
}
p->next=NULL;
return L;
}
struct ListNode *deleteeven( struct ListNode *L )
{
struct ListNode *p;
while(head&&head->data%2==0)
{
p=L;
L=L->next;
free(p);
}
p=L;
while(p&&p->next)
{
while(p->next && p->next->data%2==0)
//注意这里一定要用while,否则下一节点有偶数结点就会被跳过
//我之前用的if,逻辑是有问题的,画个运行的过程图就会知道了
{
p->next=p->next->next;
}
p=p->next;
}
return L;
}