本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中所有存储了某给定值的结点删除。链表结点定义如下:
struct ListNode {
int data;
ListNode *next;
};
函数接口定义:
struct ListNode *readlist();
struct ListNode *deletem( struct ListNode *L, int m );
函数readlist
从标准输入读入一系列正整数,按照读入顺序建立单链表。当读到−1时表示输入结束,函数应返回指向单链表头结点的指针。
函数deletem
将单链表L
中所有存储了m
的结点删除。返回指向结果链表头结点的指针。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
struct ListNode {
int data;
struct ListNode *next;
};
struct ListNode *readlist();
struct ListNode *deletem( struct ListNode *L, int m );
void printlist( struct ListNode *L )
{
struct ListNode *p = L;
while (p) {
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int main()
{
int m;
struct ListNode *L = readlist();
scanf("%d", &m);
L = deletem(L, m);
printlist(L);
return 0;
}
/* 你的代码将被嵌在这里 */
输入样例:
10 11 10 12 10 -1
10
输出样例:
11 12
代码参考:
//新建链表
struct ListNode *readlist()
{
struct ListNode *head, *tail, *pnew;
head = NULL;
tail = NULL;
pnew = NULL;
int num;
while(scanf("%d", &num), num!=-1)
{
pnew = (struct ListNode*)calloc(1,sizeof(struct ListNode));
pnew->data = num;
if(head == NULL)
{
head = pnew;
tail = pnew;
}
else{
tail->next = pnew;
tail = pnew;
}
}
return head;
}
//删除指定值的节点
struct ListNode *deletem( struct ListNode *L, int m )
{
struct ListNode *head, *pcur, *ppre;
head = L;
pcur = L;
ppre = L;
if(L==NULL)
return NULL;
else
{
while(pcur)
{
if(pcur->data == m)
{
if(head->data == m) //判断头节点是不是等于m
{
head = head->next;
pcur = head;
ppre = head;
}
else
{
ppre->next = pcur->next;
pcur=ppre->next;
free(pcur); //这个free位置要注意,用于释放删除的节点空间
}
}
else
{
ppre = pcur;
pcur = pcur->next;
}
}
}
return head;
}
(完)