lc 141.环形链表【****神奇的快慢指针】【*****双指针的用途】

官方题解https://leetcode-cn.com/problems/linked-list-cycle/solution/huan-xing-lian-biao-by-leetcode-solution/

【*****链表双指针用途】https://leetcode-cn.com/problems/linked-list-cycle/solution/yi-wen-gao-ding-chang-jian-de-lian-biao-wen-ti-h-2/①倒数第k个元素 ②获取中间元素 ③是否存在环

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        if(!head || !head->next) return false;
        ListNode *slow=head, *fast=head->next;
        while(fast!=slow){
            if(!fast || !fast->next) return false;
            fast=fast->next->next;
            slow=slow->next;
        }
        return true;
    }
};