链表之节点查找

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


struct test
{
    
    
	int data;
	struct test *next;
};

void printLink(struct test *head)
{
    
    
	struct test *point;
	point = head;
	while(point!=NULL)
	{
    
    
		printf("%d",point->data);
		point=point->next;
	}
	putchar('\n');
}
int getJieDian(struct test *head)//寻找节点数 
{
    
    
	int cnt=0;
	while(head!=NULL)
	{
    
    
		cnt++;
		head=head->next;
	}
	return cnt;
}
int main()
{
    
    

	struct test t1={
    
    1,NULL};
	struct test t2={
    
    2,NULL};
	struct test t3={
    
    3,NULL};
	struct test t4={
    
    4,NULL};
	struct test t5={
    
    5,NULL};
	
	t1.next=&t2;
	t2.next=&t3;
	t3.next=&t4;
	t4.next=&t5;
	
	printLink(&t1);
	int ret=getJieDian(&t1);
	printf("total=%d\n",ret);
	
	return 0;
}

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


struct test
{
    
    
	int data;
	struct test *next;
};

void printLink(struct test* head)
{
    
    
	struct test *point=head;
	while(point!=NULL)
	{
    
    
		printf("%d",point->data);
		point=point->next;
	}
	putchar('\n');
 } 
int searchLink(struct test* head,int data)
{
    
    
	struct test* point=head;
	while(point!=NULL)
	{
    
    
		if(point->data==data)
		{
    
    
			return 1;
		}
		point= point->next;
	}
	return 0;
}
int getJieDian(struct test *head)//寻找节点数 
{
    
    
	int cnt=0;
	while(head!=NULL)
	{
    
    
		cnt++;
		head=head->next;
	}
	return cnt;
}
int main()
{
    
    

	struct test t1={
    
    1,NULL};
	struct test t2={
    
    2,NULL};
	struct test t3={
    
    3,NULL};
	struct test t4={
    
    4,NULL};
	struct test t5={
    
    5,NULL};
	
	t1.next=&t2;
	t2.next=&t3;
	t3.next=&t4;
	t4.next=&t5;
	
	printLink(&t1);
	int ret=getJieDian(&t1);
	printf("total=%d\n",ret);
	int a=searchLink(&t1,6);
	if(a==1)
	{
    
    
		printf("WORD HERE!");
	}
	else
	{
    
    
		printf("WORD NO HERE!");
	}
	
	return 0;
}