#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#define LEN sizeof(node)
typedef struct Node {
int data;
struct Node * next;
}node;//定义结点
void create_link(node * head){//创建链表
node * h = (node *)malloc(LEN);
head->next = NULL;
h = head;
for (int i = 1; i < 10; i++){
node * p = (node *)malloc(LEN);
p->data = i;
p->next = h->next;
h->next = p;
h = p;//该代码为尾插法创建链表 ,删除这行代码为头插法创建链表
}
}
void printf_link(node * head){//打印结点
node * p = (node *)malloc(LEN);
p = head->next;
while (p != NULL){
printf("%-5d", p->data);
p = p->next;
}
}
void search_node(node *head, int n){//查找结点
node * p = (node *)malloc(LEN);
p = head->next;
int i = 1;
while (p != NULL){
if (p->data == n){
printf("找到该结点,结点位置在%d\n",i);
break;
}
p = p->next;
i++;
}
if (p == NULL) printf("没有找到该结点\n");
}
void replace(node * head,int n){//修改结点的数据
node * p = (node *)malloc(LEN);
p = head->next;
for (int i = 1; i < n; i++){
p = p->next;
}
p->data = 100;
}
void insert_node(node *head, int n){//插入结点
node * p = (node *)malloc(LEN);
p = head->next;
node * temp = (node *)malloc(LEN);
if (head != NULL){
for (int i = 1; i < n; i++)
p = p->next;
}
temp->data = 555;
temp->next = p->next;
p->next = temp;
}
void delete_node(node *head, int n){
node * p = (node *)malloc(LEN);
p = head->next;
node * temp = (node *)malloc(LEN);
if (head != NULL){
for (int i = 1; i < n - 1; i++){
p = p->next;
}
temp = p->next;
p->next = temp->next;
free(temp);
}
}
int main(){
node * head = (node *)malloc(LEN);
create_link(head);
printf_link(head);
//replace(head, 5);
putchar('\n');
insert_node(head, 5);
printf_link(head);
putchar('\n');
delete_node(head, 6);
printf_link(head);
//search_node(head, 2);
return 0;
}
单链表的基本操作(增删改查)
于 2022-04-06 15:27:28 首次发布
这篇博客详细介绍了使用C语言实现链表的基本操作,包括创建链表(尾插法和头插法)、打印链表、查找指定元素的结点、替换结点数据、在链表中插入新结点以及删除指定位置的结点。这些基本操作是理解链表数据结构和C语言编程的基础。
摘要由CSDN通过智能技术生成