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) {
         ListNode *p=head, *q=head;
		 while (q && q->next){
			 p = p->next;
			 q = q->next->next;
			 if (q == p)
				 return true;
		 }
		 return false;
    }
};