单链表结点删除

习题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的结点删除。返回指向结果链表头结点的指针。

裁判测试程序样例：

#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

#include <stdio.h>
#include <stdlib.h>

#define N 20

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;
}


struct ListNode *readlist(){
	int i=0,in,n,a[N];
	struct ListNode *h,*p,*q;

	scanf("%d", &in);
	while(in != -1){
		a[i]=in;
		i++;
		scanf("%d", &in);
	}
	n=i;
/*
	for(i=0;i<n;i++)
		printf("%d ", a[i]);
	printf("\n");
*/
	h = (struct ListNode*)malloc(sizeof(struct ListNode));
	h->data = a[0];
	h->next = NULL;
	p=q=h;

	i=1;
	while(i<n){
		q = (struct ListNode*)malloc(sizeof(struct ListNode));
		q->data = a[i];
		q->next = NULL;
		p->next = q;
		p=q;
		i++;
	}
	p->next=NULL;

	return h;
}

struct ListNode *deletem( struct ListNode *L, int m ){
	struct ListNode *p,*q,*head;

	head = L;

	/*先确定head->data 不是m*/
	while(head->data==m){
		p = head->next;
		free(head);
		head = p;
	}

	q=head;
	p=head->next;
	while(p){
		if(p->data==m){
			q->next=p->next;
			free(p);
			p=q->next;
			continue;
		}
		q=p;
		p=p->next;
	}

	return head;
}