单向循环链表的操作

最新推荐文章于 2022-07-14 16:57:59 发布

Quinf

最新推荐文章于 2022-07-14 16:57:59 发布

阅读量373

点赞数

CC 4.0 BY-SA版权

分类专栏：日常学习

本文链接：https://blog.youkuaiyun.com/Quinf/article/details/54425404

日常学习专栏收录该内容

29 篇文章

订阅专栏

本文详细介绍了一个简单的链表实现，包括创建、插入、删除节点及反转链表等基本操作，并提供了完整的C语言代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>

struct node

{

int num;

struct node *next;

};

typedef struct node Node;

typedef Node * Link;

void creat_link(Link *head)

{

//*head = NULL;

*head = (Link)malloc(sizeof(Node));

(*head)->next = *head;

}

void insert_head_node(Link *newnode, Link *head)

{

(*newnode)->next = (*head)->next;

(*head)->next = *newnode;

}

void insert_tail_node(Link *newnode, Link *head)

{

Link temp = *head;

while(temp->next != *head)

{

temp = temp->next;

}

temp->next = *newnode;

(*newnode)->next = *head;

}

int insert_mid_node(Link *newnode, Link *head, int num)

{

Link temp = (*head)->next;

while(temp != *head)

{

if(temp->num == num)

{

(*newnode)->next = temp->next;

temp->next = *newnode;

return 0;

}

temp = temp->next;

}

int delete_node(int num, Link *head)

{

Link ptr = *head;

Link temp = ptr->next;

while(temp != *head)

{

if(temp->num == num)

{

ptr->next = temp->next;

free(temp);

temp = NULL;

return 0;

}

ptr = temp;

temp = temp->next;

}

int reverse_link(Link *head)

{

if((*head)->next == *head || (*head)->next->next == *head)

{

return 0;

}

Link ptr = *head;

Link str = ptr->next;

Link temp = str->next;

while(temp != *head)

{

str->next = ptr;

ptr = str;

str = temp;

temp = temp->next;

}

str->next = ptr;

(*head)->next = str;

}

int display_link(Link *head)

{

Link temp = (*head)->next;

while(temp != *head)

{

printf("%d\n",temp->num);

temp = temp->next;

}

int main()

{

int i;

Link head;

Link newnode;

creat_link(&head);

for(i = 0; i < 10; i++)

{

newnode = (Link)malloc(sizeof(Node));

newnode->num = i + 1;

insert_head_node(&newnode,&head);

//insert_tail_node(&newnode,&head);

//insert_mid_node(&newnode,&head);

}

display_link(&head);

#if 1

newnode = (Link)malloc(sizeof(Node));

newnode->num = 5;

insert_mid_node(&newnode,&head,8);

display_link(&head);

delete_node(7,&head);

reverse_link(&head);

display_link(&head);

#endif

return 0;

}