本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中偶数值的结点删除。
函数接口定义:
struct ListNode *createlist();
struct ListNode *deleteeven( struct ListNode *head );
函数createlist
从标准输入读入一系列正整数,按照读入顺序建立单链表。当读到−1时表示输入结束,函数应返回指向单链表头结点的指针。
函数deleteeven
将单链表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() {
struct ListNode *head = NULL, *tail, *p;
int a;
scanf("%d", &a);
while(a != -1) {
p = (struct ListNode*)malloc(sizeof(struct ListNode));
p -> data = a;
p -> next = NULL;
if(head == NULL) head = p;
else tail -> next = p;
tail = p;
scanf("%d", &a);
}
return head;
}
//删除链表中的节点
struct ListNode *deleteeven( struct ListNode *head ) {
struct ListNode *p, *tail;
//先处理链表从头就需要删除的情况
while(head != NULL && head->data %2 == 0){
p = head; //用p标记head方便释放空间
head = head->next;
free(p); //释放内存空间
}
if(head == NULL) return NULL; //如果删空直接返回NULL
//处理正常情况,head%2 !=0
p = head;
tail = p -> next;
while(tail != NULL) {
if(tail -> data %2 == 0) {
p -> next = tail -> next; //tail前节点连接tail后节点
free(tail); //释放内存
}else p = tail;
tail = p -> next;
}
return head;
}