C语言-链表-笔记2（链表的输查删）

node.h

#ifndef _node_h_
#define _node_h_
typedef struct _node{	//用typedef是为了后面不用再很麻烦地用struct _node这么长的去定义变量 
	int value;
	struct _node *next;// 这里不能用 Node *next；因为程序在读到这一行时下面那个被定义的Node还没有出现 
}Node; 

#endif

linked-list.c

#include<stdio.h>
#include"node.h"
#include<stdlib.h>
//typedef struct _node{
//	int value;
//	struct _node *next;
//}Node;
typedef struct _list{
	Node* head;
} List;

void add(List* pList,int number);
void print(List *pList);
void search(List *pList,int number);
void del(List *pList,int number);

int main()
{
	List list;
	int number;
	list.head=NULL;
	do{										
		scanf("%d",&number);
		if(number!=-1){
			add(&list,number);
		}
	}while(number!=-1);
	print(&list);
	int num;
	scanf("%d",&num);
	search(&list,num);
	del(&list,num);
	//free 
	Node *p,*q;
	for(p=list.head;p;p=q){
		q=p->next;
		free(p);
	}
	return 0;  
}

void add(List* pList,int number)
{
	Node *p=(Node*)malloc(sizeof(Node));
	p->value=number;
	p->next=NULL;
	//find the last					假设没有头结点
	Node *last=pList->head;
	if(last){
		while(last->next){
			last=last->next;
		} 
		// attach
	    last->next=p;
	}else{
		pList->head=p;
	}
}

void print(List *pList){
	Node *p;
	for(p=pList->head;p;p=p->next){
		printf("%d\t",p->value);
	}
	printf("\n");
}

void search(List *pList,int number){
	Node *p;
	int isFound=0;
	for(p=pList->head;p;p=p->next){
		if(p->value==number){
			printf("找到了\n");
			isFound=1;
			break; 
		}
	}
	if(!isFound) printf("没找到\n");
}

void del(List *pList,int number){
	Node *p,*q;
	for(q=0,p=pList->head;p;q=p,p=p->next){
		if(p->value==number){
			if(q){
				q->next=p->next;	 
			}else{
				pList->head=p->next;
			}
			free(p);
			break;
		}
	}
}