leetcode: Linked List Cycle

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

Follow up:
Can you solve it without using extra space?

老题，快慢指针

/**
 * 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 == NULL || head->next == NULL)
            return false;
        ListNode *slow = head;
        ListNode *fast = head->next;
        while( fast != slow){
            if( fast->next)
                fast = fast->next;
            else
                return false;
            if( fast->next)
                fast = fast->next;
            else
                return false;
            slow = slow->next;
        }
        return true;
    }
};