LeetCode 141 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?

AC代码如下：

/**
 * 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)    
            return false;
        ListNode *runner = head;//快指针
        ListNode *walker = head;//慢指针
        while(walker -> next!=NULL && runner -> next!=NULL&&runner -> next -> next!=NULL){
            runner = runner -> next -> next;
            walker = walker -> next;
            if(runner == walker)
                return true;
        }
        return false;
    }
};