描述:
本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中所有存储了某给定值的结点删除。链表结点定义如下:
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
Code:
#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");
}
struct ListNode *readlist()
{
int temp;
struct ListNode *p,*head,*tail;
head=tail=NULL;
while(1)
{
scanf("%d",&temp);
if(temp==-1)
{
break;
}
p=(struct ListNode *) malloc(sizeof (struct ListNode));
p->data=temp;
if(!head)
{
head=p;
head->next=NULL;
}
else
{
tail->next=p;
p->next=NULL;
}
tail=p;
}
return head;
}
struct ListNode *deletem( struct ListNode *L, int m )
{
struct ListNode *head,*tail,*p;
head=tail=NULL;
while(L)
{
if(L->data!=m)
{
p=(struct ListNode *) malloc(sizeof (struct ListNode));
p->data=L->data;
if(!head)
{
head=p;
p->next=NULL;
}
else
{
tail->next=p;
p->next=NULL;
}
tail=p;
}
L=L->next;
}
return head;
}
int main()
{
int m;
struct ListNode *L = readlist();
scanf("%d", &m);
L = deletem(L, m);
printlist(L);
return 0;
}