9.6链表从指定节点后方插入新节点

9.6链表从指定节点后方插入新节点

#include<stdio.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;

}
//插入新节点代码
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;


}

int main()
{
	int i;
	int array[] = {1,2,3};
	for(i = 0;i<sizeof(array)/sizeof(array[0]);i++ ){
		printf("%d",array[i]);
	}
	putchar('\n');
	
	struct Test t1 = {1,NULL};
	struct Test t2 = {2,NULL};
	struct Test t3 = {3,NULL};
        struct Test t4 = {4,NULL};


	t1.next = &t2;
	t2.next = &t3;
	t3.next = &t4;

	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(&t1);

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

	printLink(&t1);

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