9.8链表删除指定节点

9.8链表删除指定节点

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


struct Test
{
	int data;
	struct Test *next;


};

void printLink(struct Test *head)
{
	struct Test *point;
	
	point = head;
/*
	while(1){
		if(point != NULL){
			printf("%d",point->data);
			point = point->next;	
		}else{
			putchar('\n');
			break;
		}
	}
*/

	while(point != NULL){
		printf("%d ",point->data);//
		point = point->next;
	}	
	putchar('\n');
}

int getLinkTotalNodeNum(struct Test *head)
{
	int cnt = 0;
	struct Test *p = head;
	while(p != NULL){
		cnt++;
		p = p->next;
	}
	return cnt;
}


int searchLink(struct Test *head,int data)
{
	while(head != NULL){
		if(head->data = data){
			return 0;
		}
		head = head->next;
	}
	return 0;

}

struct Test* insertFromfor(struct Test *head,int data,struct Test *new)
{
	struct Test *p = head;

	if(p->data == data){
		new->next = head;
		return new;
	}
	while(p->next != NULL){
		if(p->next->data == data){
		new->next = p->next;
		p->next = new;
		printf("insert OK\n");
		return head;
		}
		p = p->next;
	}
	printf("no this data%d\n",data);
	return head;
}

int insertFromBehind(struct Test *head,int data, struct Test *new)
{
	struct Test *p = head;
	while(p != NULL){
		if(p->data == data){
			new->next = p->next;
			p->next = new;
			return 1;
		}
		p = p->next;
	}
	return 0;


}

struct Test* deletNode(struct Test *head,int data)
{
	struct Test *p = head;
	if(p->data == data){
		head = head->next;
		free(p);//free malloc chulaide dongxi
		return head;
	}
	while(p->next != NULL){
		if(p->next->data == data){
		//	struct Test *tmp = p;
			p->next = p->next->next;\
		//	free(p);
			return head;
		}
		
		p = p->next;
	}
	return head;
}

int main()
{

	struct Test *head = NULL;
//	struct Test t1 = {1,NULL};
	struct Test *p = (struct Test *)malloc(sizeof(struct Test));
	struct Test t2 = {2,NULL};
	struct Test t3 = {3,NULL};
        struct Test t4 = {4,NULL};

	p->data = 1;
//	t1.next = &t2;
	p->next = &t2;
	t2.next = &t3;
	t3.next = &t4;

	

//	head = &t1;
	head = p;
	printLink(head);
	head = deletNode(head,4);
	printLink(head);

/*	struct Test new = {100,NULL};


	printf("use t1 to print three num\n");
//	printf("%d %d %d %d\n",t1.data,t1.next->data,t1.next->next->data,t1.next->next->next->data);

	printLink(head);

	puts("after insert behind:\n");
	insertFromBehind(head,3,&new);

	printLink(head);

	struct Test new2 = {101,NULL};
	head = insertFromfor(head,1,&new2);
	puts("after insert head:\n");
	printLink(head);

	struct Test new3 = {101,NULL};
	head = insertFromfor(head,1,&new3);
	puts("after insert head:\n");
	printLink(head);
*/
/*	
	int ret = getLinkTotalNodeNum(&t1);
	printf("total num = %d\n",ret);

	ret = searchLink(&t1,1);
	if(ret == 0){
		printf("no 1\n");
	}else{
		printf("have 1\n");
	}
	ret = searchLink(&t1,8);
        if(ret == 0){
                printf("no 8\n");
        }else{
                printf("have 8\n");
        }

*/
	return 0;
}