习题11-8 单链表结点删除 (20 分)
本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中所有存储了某给定值的结点删除。链表结点定义如下:
struct ListNode {
int data;
ListNode *next;
};
函数接口定义:
struct ListNode *readlist();
struct ListNode *deletem( struct ListNode *L, int m );
函数readlist
从标准输入读入一系列正整数,按照读入顺序建立单链表。当读到−1时表示输入结束,函数应返回指向单链表头结点的指针。
函数deletem
将单链表L
中所有存储了m
的结点删除。返回指向结果链表头结点的指针。
struct ListNode *readlist(){
int number = 0;
struct ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode)*1);
struct ListNode* last = (struct ListNode*)malloc(sizeof(struct ListNode)*1);
struct ListNode* current = NULL;
head->next = NULL;
last->next = NULL;
scanf("%d",&number);
if(number == -1){
return head->next;
}
while(number != -1){
current = (struct ListNode*)malloc(sizeof(struct ListNode)*1);
current->data = number;
current->next = NULL;
if(head->next == NULL){
head->next = current;
}
last->next = current;
last = last->next;
scanf("%d",&number);
}
return head->next;
}
struct ListNode *deletem( struct ListNode *L, int m ){
struct ListNode* frontNode = NULL;
struct ListNode* currentNode = L;
while(currentNode != NULL){
if(currentNode->data == m){
if(frontNode != NULL){
frontNode->next = currentNode->next;
}else{
L = L->next;
}
}else{
frontNode = currentNode;
}
currentNode = currentNode->next;
}
return L;
}