链表环检测

最新推荐文章于 2023-06-26 16:46:01 发布

ericming200409

最新推荐文章于 2023-06-26 16:46:01 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签： null struct include

本文链接：https://blog.youkuaiyun.com/ericming200409/article/details/5928013

数据结构与算法专栏收录该内容

10 篇文章

订阅专栏

#include <stdio.h> #include <stdlib.h> #define N 45 typedef struct Node { int key; struct Node * next; }Node; // 检测链表是否存在环 // 快慢指针方法实现 int loopCheck(Node * head) { Node *slow = head, *fast = head; while(fast != NULL && fast->next != NULL) { slow = slow->next; fast = fast->next->next; if(slow == fast) return 1; } return 0; } int main() { //创建有环链表 Node *head = malloc(sizeof(Node)); head->next = NULL; Node *current = head; Node *start; for ( int i = 0; i < 5000 ; i++ ) { current->next = malloc(sizeof(Node)); current = current->next; current->next = NULL; //保存指针以备建立环 if(i == N) { start = current; } } //current->next = start; //检测环是否存在 if(loopCheck(head)) printf("there is a loop in the link list./n"); else printf("there is no loop"); return 0; }