为方便理解,我画了个图在下面,建议先看完代码再看图
本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中偶数值的结点删除。链表结点定义如下:
struct ListNode {
int data;
struct ListNode *next;
};
函数接口定义:
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;
}
/* 你的代码将被嵌在这里 */
SOLUTION
struct ListNode* createlist() {
struct ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode));
struct ListNode* now = head;
int input_int;
scanf("%d", &input_int);
while (input_int != -1) {
struct ListNode* temp = (struct ListNode*)malloc(sizeof(struct ListNode));
temp->data = input_int;
temp->next = NULL;
now->next = temp;
now = temp;
scanf("%d", &input_int);
}
return head;
}
struct ListNode* deleteeven(struct ListNode* head) {
struct ListNode* now = head->next;
struct ListNode* prev = head;
while (now) {
if (now->data % 2 == 0) {
prev->next = now->next; //删除操作
}
else prev = now; //只有当未进行删除操作时,即prev下一个指向的结点->data == 奇数的时候(具体解释看下图)
now = now->next; //无论什么情况,当前指针每进行一次循环都要往前移位
}
return head->next;
}