循环链表基本操作

最新推荐文章于 2024-01-21 20:24:54 发布

cymx2002

最新推荐文章于 2024-01-21 20:24:54 发布

阅读量251

点赞数 2

CC 4.0 BY-SA版权

分类专栏：面试题文章标签： null insert delete output struct system

本文链接：https://blog.youkuaiyun.com/cymx2002/article/details/5966336

面试题专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个使用C语言实现的循环链表示例，包括插入、删除等基本操作，并通过一个具体场景（按步进删除节点直至链表为空）展示了这些操作的应用。该示例不仅实现了循环链表的基本功能，还提供了两种不同的删除节点的方法。

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

题目大致如下：

实现循环链表的插入删除操作

插入1-100个数，再按步进为2依次删除，3，5，7，9，13，15，17...直到链表为空，打印出依次删除的数

我当时没有完全做出来，现在已经实现，将代码贴到下面，不是最好的方法，欢迎大家讨论。

#include <stdio.h> #include <stdlib.h> #include <string.h> #include <windows.h> #define QUICK_DELETE typedef struct node { int data; struct node *next; }NodeT; void output(NodeT *Tail); NodeT *insert(NodeT **Tail, int data); NodeT *delete(NodeT **Tail, int data); //return the front ptr NodeT *quickdelete(NodeT *front, NodeT *current); NodeT *Tail = NULL; int main() { long begin, end; #ifdef QUICK_DELETE NodeT *front; #endif NodeT *head, *current; int i, step = 2; for(i = 1; i <= 100; i++) { insert(&Tail, i); } output(Tail); printf("---------------------------------------------------------------/n"); head = Tail->next; current = head; #ifdef QUICK_DELETE front = current; #endif begin = GetTickCount(); while(current != NULL) { while(step != 0) { #ifdef QUICK_DELETE front = current; #endif current = current->next; step--; } step = 2; //delete printf("%d ", current->data); #ifdef QUICK_DELETE current = quickdelete(front, current); #else current = delete(&Tail, current->data); #endif } end = GetTickCount(); printf("/n"); printf("end - begin = %d ms!/n", end - begin); system("pause"); return 0; } void output(NodeT *Tail) { NodeT *head = NULL, *current = NULL; if(Tail == NULL) return; head = Tail->next; current = head; while(current != Tail) { printf("%d ", current->data); current = current->next; } while(current != head->next) { printf("%d ", current->data); current = current->next; } printf("/n"); } NodeT *insert(NodeT **Tail, int data) { NodeT *newp = NULL; if(Tail == NULL) return NULL; newp = (NodeT *)malloc(sizeof(NodeT)); if(newp == NULL) return NULL; newp->data = data; newp->next = NULL; if(*Tail == NULL) { *Tail = newp; newp->next = newp; } else { newp->next = (*Tail)->next; (*Tail)->next = newp; } *Tail = (*Tail)->next; return (*Tail)->next; } NodeT *delete(NodeT **Tail, int data) { int find = 0; NodeT *head, *current, *front; if(Tail == NULL || *Tail == NULL) return NULL; head = (*Tail)->next; current = head; front = *Tail; while(current != *Tail) { if(current->data == data) { find = 1; break; } else { front = current; current = current->next; } } if((*Tail)->data == data) find = 1; if(find != 1) return NULL; if(head == *Tail) { free(*Tail); *Tail = front = current = NULL; } else { if(current == *Tail) { front->next = current->next; *Tail = front; free(current); } else { front->next = current->next; free(current); } } return front; } NodeT *quickdelete(NodeT *front, NodeT *current) { if(front == current && current == Tail) { free(current); return NULL; } else { if(current == Tail) { front->next = current->next; Tail = front; free(current); } else { front->next = current->next; free(current); } } return front; }