實驗11-2-8 單鏈表結(jié)點刪除 (20 分)
1. 題目摘自
https://pintia.cn/problem-sets/13/problems/609
2. 題目內(nèi)容
本題要求實現(xiàn)兩個函數(shù)，分別將讀入的數(shù)據(jù)存儲為單鏈表、將鏈表中所有存儲了某給定值的結(jié)點刪除赶促。鏈表結(jié)點定義如下：
struct ListNode {
int data;
ListNode *next;
};
函數(shù)接口定義：
struct ListNode *readlist();
struct ListNode *deletem( struct ListNode *L, int m );
函數(shù)readlist從標準輸入讀入一系列正整數(shù)，按照讀入順序建立單鏈表捆交。當讀到?1時表示輸入結(jié)束茧妒，函數(shù)應返回指向單鏈表頭結(jié)點的指針姿骏。
函數(shù)deletem將單鏈表L中所有存儲了m的結(jié)點刪除身笤。返回指向結(jié)果鏈表頭結(jié)點的指針豹悬。
輸入樣例：
10 11 10 12 10 -1
10
輸出樣例：
11 12
3. 源碼參考
#include <iostream>
#include <stdlib.h>
using namespace std;
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();
cin >> m;
L = deletem(L, m);
printlist(L);
return 0;
}
struct ListNode *readlist()
{
struct ListNode *p, *h, *t;
int n;
h = NULL;
cin >> n;
while(n != -1)
{
p = (struct ListNode*)malloc(sizeof(struct ListNode));
p->data = n;
p->next = NULL;
if(h == NULL)
{
h = p;
}
else
{
t->next = p;
}
t = p;
cin >> n;
}
return h;
}
struct ListNode *deletem( struct ListNode *L, int m )
{
struct ListNode *p;
while((L != NULL) && (L->data == m))
{
L = L->next;
}
p = L;
while(p->next)
{
if(p->next->data == m)
{
p->next = p->next->next;
}
else
{
p = p->next;
}
}
return L;
}
