用c语言实现 链表从指定节点前方插入新节点

用c语言实现 链表从指定节点前方插入新节点

#include<stdio.h>
struct Test
{
 int data;
 struct Test *next;
};
void printLine(struct Test *head)
{
 struct Test *point;
 point = head;
 while(point != NULL)
 {
 	printf("%d ",point->data);
	point = point->next;
 	
 }
 putchar('\n');

}
int printnum(struct Test *head)
{
 int sum;
 while(head != NULL)
 {
 	head = head -> next;
	sum ++;
 
 }
 return sum;


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

}
int insert(struct Test *head,int data,struct Test *new)
{
	struct Test *point = head;
	while(point != NULL){
		if(point->data == data)
		{
			new->next = point->next;
			point->next = new; 
		}
		point = point->next;
	
	}


	return 0;
}
struct Test* qiancha(struct Test *head,int data,struct Test *new)
{
	struct Test *point = head;
	if(point->data == data){
		new->next = point;
		return new;
	}
	while(point->next !=NULL)
	{
		if(point->next->data == data)
		{
			new->next=point->next;
			point->next=new;
			printf("qianinsert:ok!\n");
		       	return head;  	
		
		}
		point = point->next;
	
	}
	printf("qiancha:no!\n");
	return head;
}
int main()
{
 int arry[]={1,2,3};
 int i;
 for(i=0;i<sizeof(arry)/sizeof(arry[0]);i++)
 {
 	printf("%d ",arry[i]);
 
 }
 putchar('\n');
 	struct Test t1={1,NULL};
 	struct Test t2={2,NULL};
 	struct Test t3={3,NULL};
	struct Test t4={4,NULL};
	struct Test new={100,NULL};
	struct Test new1={101,NULL};
	struct Test new2={102,NULL};
	struct Test *head=&t1;
	t1.next = &t2;
	t2.next = &t3;
	t3.next = &t4;
	printLine(&t1);
	insert(head,1,&new);
	printLine(head);
	head = qiancha(head,1,&new1);
	printLine(head);
	head = qiancha(head,3,&new2);
	printLine(head);
	//printf("%d,%d,%d",t1.data,t1.next->data,t1.next->next->data);
/*	int ret = printnum(&t1);
	printf("total number:%d\n",ret);
	ret = searchnum(&t1,1);
	if(ret == 0)
	{
	printf("no 1\n");
	}else
	{
	printf(" have 1\n"
);
	}
	ret = searchnum(&t1,8);
	if(ret == 1)
	{
	printf("no 8\n");
	}else
	{
	printf("have 8\n");
	}
	 return 0;*/
}

运行结果

在这里插入图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值