C语言实现单链表(考研笔记)

概述

给需要考研的同学一个参考,单链表作为常见数据结构的一种,这里记录C语言实现单链表。

代码

函数原型和结构体声明

c 复制代码
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#define true 1
#define false 0
#define bool char
//链表数据类型
typedef int ElementType;
//链表节点结构体
typedef struct LNode {
	ElementType data;
	struct LNode* next;

} LNode;
bool intLNode(LNode** head);
bool insertLNodeFromPos(LNode* head, int pos, ElementType data);
bool inserteEndLNodeFromTargetValue(LNode* head, ElementType target, ElementType data);
bool inserteBeforeLNodeFromTargetValue(LNode* head, ElementType target, ElementType data);
bool deleteFromPos(LNode* head, int pos);
//链表按值删除(带头节点)
bool deleteFromTargetValue(LNode* head, LNode* node);
LNode* query(LNode* head, ElementType target);

main函数

c 复制代码
int main() {
	LNode *head ;
	intLNode(&head);
	insertLNodeFromPos(head, 1, 1);
	insertLNodeFromPos(head, 2, 2);
	insertLNodeFromPos(head, 1, 101);
	inserteEndLNodeFromTargetValue(head, 2, 221);
	inserteBeforeLNodeFromTargetValue(head, 2, 333);
	//deleteFromPos(head, 3);
	deleteFromTargetValue(head, head->next->next->next);
	printf("%d",head->next->next->next->data);
	//printf("%d", query(head, 101)->data);
	return 0;
}

初始化(带头节点)

c 复制代码
 bool intLNode(LNode** head) {
	 *head = (LNode*)malloc(sizeof(LNode));
	 if (*head == NULL) {
		 return false;
	 }
	 (*head)->data = 0;
	 (*head)->next = NULL;
	 return true;
}

链表按位置插入(带头节点)

c 复制代码
 bool insertLNodeFromPos(LNode* head,int pos, ElementType data) {
	 //边界值判断
	 if (pos < 1) {
		 return false;
	 }
	 LNode* current = head;
	 int index = 0;
	 while (current!=NULL) {
		 if (index == pos - 1) {
			 break;
		}
		 current = current->next;
		 index++;
	}
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return false;
	 }
	 //创建新节点
	 LNode* newNode = (LNode*)malloc(sizeof(LNode));
	 if (newNode == NULL) {
		 return false;
	 }
	 //更改指针指向
	 newNode->data = data;
	 
	 newNode->next = current->next;
	 current->next = newNode;
	 return true;
 }

链表按数据值后插入(带头节点)

c 复制代码
 bool inserteEndLNodeFromTargetValue(LNode* head, ElementType target, ElementType data) {
	 LNode* current = head;
	 while (current != NULL) {
		 if (current->data == target) {
			 break;
		 }
		 current = current->next;
	 }
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return false;
	 }
	 //创建新节点
	 LNode* newNode = (LNode*)malloc(sizeof(LNode));
	 if (newNode == NULL) {
		 return false;
	 }
	 //更改指针指向
	 newNode->data = data;
	 newNode->next = current->next;
	 current->next = newNode;
	 return true;
 }

链表按数据值前插入(带头节点)

c 复制代码
 bool inserteBeforeLNodeFromTargetValue(LNode* head, ElementType target, ElementType data) {
	 LNode* current = head;
	 while (current != NULL) {
		 if (current->data == target) {
			 break;
		 }
		 current = current->next;
	 }
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return false;
	 }
	 //创建新节点
	 LNode* newNode = (LNode*)malloc(sizeof(LNode));
	 if (newNode == NULL) {
		 return false;
	 }
	 //更改指针指向
	 newNode->data = current->data;
	 newNode->next = current->next;
	 current->next = newNode;
	 current->data = data;
	 return true;
 }

链表按位置删除(带头节点)

c 复制代码
 bool deleteFromPos(LNode* head, int pos) {
	 if (pos < 1) {
		 return false;
	 }
	 LNode* current = head;
	 int index = 0;
	 while (current != NULL) {
		 if (index==pos-1) {
			 break;
		 }
		 current = current->next;
		 index++;
	 }
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return false;
	 }
	 //更改指针指向
	 LNode* temp = current->next;
	 current->next = current->next->next;
	 //释放断开节点的内存空间
	 free(temp);
	 return true;
 }

链表按指定节点删除(带头节点)

c 复制代码
 bool deleteFromTargetValue(LNode* head,LNode *node) {
	 LNode* current = head;
	 while (current != NULL) {
         //找到需要删除的节点的前一个节点
		 if (current->next == node) {
			 break;
		 }
		 current = current->next;
	 }
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return false;
	 }
	 //更改指针指向
	 LNode* temp = current->next;
	 current->next = current->next->next;
	 free(temp);
	 return true;
 }

链表查找对应的节点

c 复制代码
 LNode* query(LNode* head, ElementType target) {
	 LNode* current = head;
	 while (current != NULL) {
		 if (current->data == target) {
			 break;
		 }
		 current = current->next;
	 }
	 //确保当前没有超出范围
	 if (current == NULL) {
		 return NULL;
	 }
	 return current;
 }
相关推荐
这里有鱼汤15 分钟前
分享一个实用的主力抄底的“三合一指标”:主力吸货 + 风险 + 趋势
后端
小莞尔17 分钟前
【51单片机】【protues仿真】基于51单片机的篮球计时计分器系统
c语言·stm32·单片机·嵌入式硬件·51单片机
小莞尔26 分钟前
【51单片机】【protues仿真】 基于51单片机八路抢答器系统
c语言·开发语言·单片机·嵌入式硬件·51单片机
liujing1023292936 分钟前
Day03_刷题niuke20250915
c语言
小桥风满袖38 分钟前
极简三分钟ES6 - ES8中字符串扩展
前端·javascript
张拭心38 分钟前
这就是流量的力量吗?用豆包 AI 编程做的xhs小组件帖子爆了
前端·ai编程·豆包marscode
少年阿闯~~42 分钟前
CSS3的新特性
前端·javascript·css3
IT_陈寒1 小时前
React性能优化:这5个Hook技巧让我的组件渲染效率提升50%(附代码对比)
前端·人工智能·后端
Captaincc1 小时前
9 月 20 日,TRAE Meetup@Guangzhou 相聚羊城
人工智能·后端