c语言链表的简单实现

c语言链表的简单实现

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


typedef struct LinkNode
{
	int val;
	struct LinkNode* next;
}LinkNode;


//尾插法就需要尾指针,在追加数据时不断的更新位置,一直指向链表末尾(动态的)
LinkNode* head = NULL;
LinkNode* tail = NULL;

// 尾创建
void addTail(int data)
{
	//创建节点:
	LinkNode* newNode = (LinkNode*)malloc(sizeof(LinkNode));
	newNode->val = data;
	newNode->next = NULL;


	if (head == NULL)   //第一次插入新节点时                        
		head = newNode;
	else
		tail->next = newNode;
	tail = newNode;  // 更新尾部位置 
}


// 插入
void insert_node(int index, int data)
{
	LinkNode* newNode = (LinkNode*)malloc(sizeof(LinkNode));  //创建新节点
	newNode->val = data;

	LinkNode* pre = head;

	if (index == 0) // 在头节点前操作时,没有前驱点的情况
	{
		newNode->next = head;
		head = newNode; // head指针指向新的节点 (更新)
	}
	else
	{
		int i = 0;
		while (i < index - 1) //找到前驱点
		{
			pre = pre->next;   //找前驱点的过程就是前驱点的移动移动//更新per的位置
			i++;
		}

		newNode->next = pre->next;
		pre->next = newNode;

		if (newNode->next == NULL) //插入的其实是尾部的话
			tail = pre;
	}
}

// 删除指定元素
void deleteVal(int data)
{
	LinkNode* pre = head;
	LinkNode* cur = head->next;

	if (pre->val == data)
	{
		head = head->next;
		free(pre);
	}
	else
	{
		while (cur->next)
		{
			if (cur->val == data)
				break;
			pre = pre->next;
			cur = pre->next;
		}

		pre->next = cur->next;
		if (cur->next == NULL)  // 删除的其实是尾部的话
		{
			cur = NULL;
			pre->next = NULL;
		}

		free(cur);

	}
}

// 删除指定索引
void deleteInd(int index)
{
	LinkNode* pre = head;

	if (index >= count() || index < 0)
		return;

	if (index == 0)
	{
		head = head->next;
		free(pre);
	}
	else
	{
		int i = 0;
		while (i < index - 1)
		{
			pre = pre->next;
			i++;
		}

		LinkNode* temp = pre->next;
		pre->next = pre->next->next;

		if (temp->next == NULL) // 删除的其实是尾部的话
			tail = pre;

		free(temp);
	}
}


// 显示
void show()
{
	LinkNode* pre = head;

	while (pre)
	{
		printf("%d", pre->val);
		pre = pre->next;
	}
	printf("\n");  //全部循环完换行

}

int count()
{
	LinkNode* pre = head;
	int count = 0;
	while (pre)
	{
		pre = pre->next;
		printf("%d\n", count);
		count++;
	}
	return count;
}


int main(void)
{
	addTail(1);
	addTail(2);
	addTail(3);
	addTail(4);
	//insert_node(4, 0);
	deleteVal(4);
	/*deleteInd(3);*/
	show();
	return 0;
}