C语言——静态创建链表（增删改查）

#include <stdio.h>
#include <stdlib.h>
struct LinkList
{
	int data;
	struct LinkList *next;
};
//遍历链表
void printLinkList(struct LinkList *head)
{
	struct LinkList * point;
	point = head;
	while(point != NULL)
	{
		printf("%d ",point->data);
		point = point->next;
	}
	putchar('\n');
}
//获取链表元素个数
void getLinkListTotalNum(struct LinkList *head)
{
	struct LinkList *point = head;
	int num = 0;
	while(point != NULL)
	{
		num++;
		point = point->next;
	}
	printf("链表总个数：%d\n",num);
}
int searchLinkList(struct LinkList *head,int searchData)//查找指定元素
{
	struct LinkList * point = head;
	while(point != NULL)
	{
		if(point->data != searchData)
		{	
			return 1;
		}
		point = point->next;
	}
	return 0;
}
int changeLinkList(struct LinkList *head,int searchData,int changeData)//修改指定元素
{
	struct LinkList * point = head;
	while(point != NULL)
	{
		if(point->data == searchData)
		{	
			point->data = changeData;
			return 1;
			break;
		}
		point = point->next;
	}
	printf("修改失败\n");
	return 0;
}
//在指定元素后面插入元素
int insertLinkList_Behind(struct LinkList *head,int insertData,struct LinkList *new)
{
	struct LinkList *point = head;
	while(point != NULL)
	{
		if(insertData == point->data)
		{
			new->next = point->next;
			point->next = new;
			return 1;
		}
		point = point->next;
	}
	printf("插入元素失败\n");
	return 0;
}
//在指定元素前面插入元素
struct LinkList * insertLinkList_Forward(struct LinkList *head,int insertData,struct LinkList *new)
{
	struct LinkList * point = head;
	if(head != NULL && head->data == insertData)
	{
		new->next = head;
		return new;
	}
	while(point->next != NULL)
	{

		if(point->next->data == insertData)
		{
			new->next = point->next;
			point->next = new;
			return head;
		}
		point = point->next;
	}
	printf("节点前插入元素失败\n");
	return head;
}
//删除指定元素
struct LinkList *deleteLinkList(struct LinkList *head,int deleteData)
{
	struct LinkList *point = head;
	if(head->data == deleteData)
	{
		head = head->next;
		free(point);
		return head;
	}
	while(point->next != NULL)
	{
		if(point->next->data == deleteData)
		{
			point->next = point->next->next;
			return head;
		}
		point = point->next;
	}
	printf("删除元素失败\n");
	return head;
}
int main(int argc, char const *argv[])
{	
	struct LinkList *head = NULL;
	struct LinkList *p;
	p = (struct LinkList *)malloc(sizeof(struct LinkList));
	struct LinkList t1 = {1,NULL};
	struct LinkList t2 = {2,NULL};
	struct LinkList t3 = {3,NULL};
	int ret = 0;
	int searchData = 2;
	head = p;
	p->data = 1;
	p->next = &t2;
	t2.next = &t3;
	printLinkList(head);
	getLinkListTotalNum(head);
	/*
	scanf("%d",&searchData);
	ret = searchLinkList(head,searchData);
	if(ret)
	{
		printf("链表中有元素：%d\n",searchData);
	}else
	{
		printf("链表中没有元素：%d\n",searchData);
	}
	changeLinkList(head,4,20);
	printLinkList(head);*/
	/*struct LinkList new = {100,NULL};
	insertLinkList_Behind(head,3,&new);
	printLinkList(head);*/
	/*struct LinkList new2 = {101,NULL};
	head = insertLinkList_Forward(head,2,&new2);
	printLinkList(head);*/
	head = deleteLinkList(head,2);
	printLinkList(head);
	getLinkListTotalNum(head);
	return 0;
}