leetcode 141. Linked List Cycle

141. Linked List Cycle:题目链接
     官方解析:题目链接

AC code:

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