力扣热题一百道：环形链表

原题链接：https://leetcode.cn/problems/linked-list-cycle/description/?envType=study-plan-v2&envId=top-100-likedhttps://leetcode.cn/problems/linked-list-cycle/description/?envType=study-plan-v2&envId=top-100-liked 

bool hasCycle(struct ListNode *head) {
    if(head ==NULL)
        return false;
    struct ListNode* slow = head,*fast = head;
    bool result = false;
    while(fast->next!=NULL && fast->next->next != NULL)
    {
        slow = slow->next;
        fast = fast->next->next;
        if(fast == slow)
        {
            result = true;
            break;
        }
    }
    return result;
}

这个题只需要使用快慢指针就可以解决