141. Linked List Cycle C语言_c语言linked list cycle-CSDN博客

本文链接：https://blog.csdn.net/yileahcwks/article/details/87081113

题目描述：

Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

解析：判断是否是循环链表，利用快慢指针，快指针走两步，慢指针走一步，当两个指针指向一个节点为循环链表。

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
bool hasCycle(struct ListNode *head) {
    struct ListNode *p, *q;
    p = head;
    q = head;
    while(p != NULL && q != NULL && q->next != NULL){
        p = p->next;
        q = q->next->next;
        if(p == q){
            return true;
        }
    }
    return false;
    
}